
/*  A Bison parser, made from c-parse.y  */

#define	IDENTIFIER	258
#define	TYPENAME	259
#define	SCSPEC	260
#define	TYPESPEC	261
#define	TYPE_QUAL	262
#define	CONSTANT	263
#define	STRING	264
#define	ELLIPSIS	265
#define	SIZEOF	266
#define	ENUM	267
#define	STRUCT	268
#define	UNION	269
#define	IF	270
#define	ELSE	271
#define	WHILE	272
#define	DO	273
#define	FOR	274
#define	SWITCH	275
#define	CASE	276
#define	DEFAULT	277
#define	BREAK	278
#define	CONTINUE	279
#define	RETURN	280
#define	GOTO	281
#define	ASM	282
#define	TYPEOF	283
#define	ALIGNOF	284
#define	ASSIGN	285
#define	OROR	286
#define	ANDAND	287
#define	EQCOMPARE	288
#define	ARITHCOMPARE	289
#define	LSHIFT	290
#define	RSHIFT	291
#define	UNARY	292
#define	PLUSPLUS	293
#define	MINUSMINUS	294
#define	HYPERUNARY	295
#define	POINTSAT	296

#line 47 "c-parse.y"

#include "config.h"
#include "tree.h"
#include "c-parse.h"
#include "c-tree.h"

#include <stdio.h>
#include <errno.h>

#ifndef errno
extern int errno;
#endif

void yyerror ();

/* Cause the `yydebug' variable to be defined.  */
#define YYDEBUG 1

#line 68 "c-parse.y"
typedef union {long itype; tree ttype; enum tree_code code; } YYSTYPE;
#line 156 "c-parse.y"

/* the declaration found for the last IDENTIFIER token read in.
   yylex must look this up to detect typedefs, which get token type TYPENAME,
   so it is left around in case the identifier is not a typedef but is
   used in a context which makes it a reference to a variable.  */
static tree lastiddecl;

static tree make_pointer_declarator ();
static tree combine_strings ();
static void reinit_parse_for_function ();

/* List of types and structure classes of the current declaration */
tree current_declspecs;

char *input_filename;		/* source file current line is coming from */
char *main_input_filename;	/* top-level source file */

int undeclared_variable_notice;	/* 1 if we explained undeclared var errors. */

static int yylex ();

#ifndef YYLTYPE
typedef
  struct yyltype
 {
      int timestamp;
      int first_line;
      int first_column;
      int last_line;
      int last_column;
      char *text;
   }
 yyltype;

#define YYLTYPE yyltype
#endif

#include <stdio.h>

#ifndef __STDC__
#define const
#endif



#define	YYFINAL		495
#define	YYFLAG		-32768
#define	YYNTBASE	64

#define YYTRANSLATE(x) ((unsigned)(x) <= 296 ? yytranslate[x] : 167)

static const char yytranslate[] = {     0,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,    60,     2,     2,     2,    47,    38,     2,    54,
    56,    45,    43,    61,    44,    53,    46,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,    33,    57,     2,
    31,     2,    32,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
    55,     2,    63,    37,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,    62,    36,    58,    59,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     1,     2,     3,     4,     5,
     6,     7,     8,     9,    10,    11,    12,    13,    14,    15,
    16,    17,    18,    19,    20,    21,    22,    23,    24,    25,
    26,    27,    28,    29,    30,    34,    35,    39,    40,    41,
    42,    48,    49,    50,    51,    52
};

static const short yyrline[] = {     0,
   179,   180,   187,   189,   189,   190,   192,   194,   195,   202,
   208,   210,   212,   214,   216,   217,   218,   221,   227,   229,
   230,   232,   237,   239,   240,   242,   247,   249,   250,   254,
   256,   259,   261,   263,   265,   267,   269,   271,   275,   279,
   282,   285,   288,   292,   294,   296,   298,   303,   305,   310,
   314,   316,   319,   333,   335,   337,   339,   341,   343,   345,
   347,   349,   351,   353,   355,   357,   359,   361,   363,   365,
   367,   371,   420,   421,   423,   425,   427,   434,   438,   440,
   442,   444,   446,   448,   453,   455,   459,   461,   464,   466,
   467,   468,   473,   478,   481,   483,   485,   493,   496,   500,
   502,   504,   512,   515,   517,   519,   528,   531,   535,   537,
   545,   546,   547,   548,   552,   560,   561,   562,   565,   567,
   570,   572,   575,   578,   586,   591,   592,   597,   602,   603,
   608,   610,   614,   616,   618,   624,   627,   634,   636,   641,
   644,   649,   651,   653,   655,   663,   669,   671,   673,   675,
   681,   687,   689,   691,   693,   695,   698,   703,   707,   710,
   712,   714,   716,   719,   721,   724,   727,   730,   733,   737,
   739,   742,   744,   748,   750,   752,   766,   770,   773,   777,
   782,   783,   787,   790,   792,   801,   803,   808,   811,   815,
   818,   822,   825,   828,   831,   835,   838,   842,   846,   848,
   850,   852,   854,   856,   858,   860,   868,   870,   871,   874,
   876,   879,   882,   891,   893,   896,   897,   901,   905,   911,
   916,   918,   920,   924,   927,   928,   930,   933,   937,   938,
   941,   943,   948,   953,   957,   963,   969,   976,   978,  1010,
  1010,  1021,  1021,  1025,  1029,  1032,  1035,  1039,  1045,  1051,
  1057,  1063,  1068,  1068,  1073,  1078,  1084,  1087,  1092,  1094,
  1097,  1099,  1103,  1108,  1111,  1117,  1120,  1127,  1130,  1135,
  1137,  1139,  1143,  1145,  1151,  1153,  1155,  1159,  1162,  1168,
  1171,  1173,  1175,  1177,  1182,  1185
};

static const char * const yytname[] = {     0,
"error","$illegal.","IDENTIFIER","TYPENAME","SCSPEC","TYPESPEC","TYPE_QUAL","CONSTANT","STRING","ELLIPSIS",
"SIZEOF","ENUM","STRUCT","UNION","IF","ELSE","WHILE","DO","FOR","SWITCH",
"CASE","DEFAULT","BREAK","CONTINUE","RETURN","GOTO","ASM","TYPEOF","ALIGNOF","ASSIGN",
"'='","'?'","':'","OROR","ANDAND","'|'","'^'","'&'","EQCOMPARE","ARITHCOMPARE",
"LSHIFT","RSHIFT","'+'","'-'","'*'","'/'","'%'","UNARY","PLUSPLUS","MINUSMINUS",
"HYPERUNARY","POINTSAT","'.'","'('","'['","')'","';'","'}'","'~'","'!'",
"','","'{'","']'","program"
};

static const short yyr1[] = {     0,
    64,    64,    66,    65,    67,    65,    68,    68,    68,    69,
    69,    69,    69,    69,    69,    69,    69,    71,    72,    70,
    70,    73,    74,    70,    70,    75,    76,    70,    70,    77,
    77,    78,    78,    78,    78,    78,    78,    78,    79,    80,
    80,    81,    81,    82,    82,    82,    82,    82,    82,    82,
    83,    83,    83,    84,    84,    84,    84,    84,    84,    84,
    84,    84,    84,    84,    84,    84,    84,    84,    84,    84,
    84,    85,    85,    85,    85,    85,    86,    85,    85,    85,
    85,    85,    85,    85,    87,    87,    88,    88,    89,    89,
    89,    89,    90,    91,    91,    91,    91,    92,    92,    93,
    93,    93,    94,    94,    94,    94,    95,    95,    96,    96,
    97,    97,    97,    97,    97,    98,    98,    98,    99,    99,
   100,   100,   101,   101,   103,   102,   102,   105,   104,   104,
   106,   106,   106,   106,   106,   107,   107,   108,   108,   109,
   109,   109,   109,   109,   109,   110,   110,   110,   110,   110,
   111,   111,   111,   111,   111,   111,   113,   112,   112,   112,
   114,   112,   112,   112,   115,   112,   116,   112,   112,   117,
   117,   118,   118,   119,   119,   119,   120,   120,   120,   121,
   121,   121,   122,   122,   122,   123,   123,   124,   124,   125,
   125,   126,   126,   127,   127,   128,   128,   129,   129,   129,
   129,   129,   129,   129,   129,   129,   130,   130,   130,   131,
   131,   132,   133,   134,   134,   135,   135,   135,   135,   137,
   136,   138,   138,   139,   138,   138,   140,   141,   138,   142,
   143,   138,   144,   145,   146,   138,   147,   138,   148,   138,
   149,   138,   138,   138,   138,   138,   138,   138,   138,   138,
   138,   150,   138,   138,   151,   151,   152,   152,   153,   153,
   154,   154,   155,   156,   156,   158,   157,   160,   159,   161,
   161,   161,   162,   162,   163,   163,   163,   164,   164,   165,
   165,   165,   165,   165,   166,   166
};

static const short yyr2[] = {     0,
     0,     1,     0,     2,     0,     3,     1,     1,     5,     3,
     4,     4,     2,     2,     2,     2,     1,     0,     0,     7,
     4,     0,     0,     7,     4,     0,     0,     6,     3,     1,
     1,     1,     1,     1,     1,     1,     1,     1,     1,     0,
     1,     1,     3,     1,     2,     2,     2,     4,     2,     4,
     1,     4,     7,     1,     3,     3,     3,     3,     3,     3,
     3,     3,     3,     3,     3,     3,     3,     3,     5,     3,
     3,     1,     1,     1,     3,     3,     0,     4,     4,     4,
     3,     3,     2,     2,     1,     2,     0,     1,     1,     1,
     2,     2,     0,     4,     4,     2,     2,     2,     3,     0,
     2,     2,     1,     1,     2,     2,     2,     3,     0,     2,
     1,     1,     1,     4,     4,     1,     1,     1,     1,     3,
     1,     3,     0,     4,     0,     5,     2,     0,     5,     2,
     1,     2,     3,     4,     1,     1,     3,     1,     1,     3,
     3,     4,     3,     3,     1,     3,     4,     3,     3,     1,
     3,     3,     3,     4,     3,     1,     0,     6,     4,     2,
     0,     6,     4,     2,     0,     7,     0,     6,     2,     0,
     1,     0,     1,     0,     3,     2,     3,     3,     1,     0,
     1,     3,     1,     3,     2,     1,     3,     1,     3,     2,
     2,     0,     1,     1,     2,     0,     2,     3,     3,     2,
     3,     4,     3,     2,     3,     2,     1,     2,     2,     0,
     1,     2,     0,     1,     2,     2,     5,     4,     4,     0,
     6,     1,     2,     0,     4,     1,     0,     0,     7,     0,
     0,     9,     0,     0,     0,    12,     0,     6,     0,     5,
     0,     4,     2,     2,     2,     3,     6,     8,    10,    12,
     3,     0,     4,     1,     0,     1,     0,     1,     0,     1,
     1,     3,     4,     1,     3,     0,     2,     0,     2,     2,
     2,     2,     2,     2,     0,     1,     3,     1,     3,     2,
     2,     2,     2,     2,     1,     3
};

static const short yydefact[] = {     3,
     5,     0,     0,     0,   113,   104,   111,   103,     0,     0,
     0,     0,     0,    17,     4,     8,     7,     0,    93,    93,
   100,   112,     6,    15,    16,    30,    31,   167,   169,   174,
   160,   174,   164,     0,     0,   156,   196,     0,     0,   121,
     0,    14,     0,   106,   105,    13,     0,   100,    98,     0,
   165,     0,   157,     0,   161,    85,     0,    72,   194,    73,
     0,     0,    32,    34,    33,     0,    35,    36,     0,    37,
    38,     0,     0,    39,    51,    54,    42,    44,    74,   192,
   109,     0,   192,     0,     0,    10,     0,    29,     0,   268,
     0,     0,   130,   145,   196,     0,     0,   119,     0,   138,
   139,     0,     0,    99,   102,   116,   117,   101,   118,   188,
   172,   186,     0,   179,   176,   159,    93,     0,    93,   174,
   163,   174,    86,     0,     0,    47,     0,    49,    45,     0,
     0,     0,     0,    46,   114,     0,     0,     0,   257,     0,
     0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
     0,     0,     0,    83,    84,     0,     0,    40,     0,   196,
   266,     0,   190,   193,   107,   115,   195,   109,   191,   197,
   153,   152,   122,   123,     0,   151,     0,   155,     0,     0,
    27,    88,     0,    93,    93,    90,   128,     0,     0,    12,
     0,    21,     0,   127,   268,     0,    11,    25,     0,     0,
   173,     0,   172,   180,   175,   180,     0,     0,     9,     0,
     0,    76,    75,   213,     0,     0,    43,    71,    70,   258,
     0,    68,    67,    65,    66,    64,    63,    62,    60,    61,
    55,    56,    57,    58,    59,    82,    81,     0,    41,     0,
   200,     0,   204,     0,   206,     0,   266,     0,   110,   108,
     0,     0,   285,   192,   192,   269,     0,   276,   278,     0,
   154,   212,     0,    91,    92,    96,     0,    97,     0,     0,
   144,   140,   120,    19,   125,   141,   143,     0,    23,   189,
   187,   168,     0,     0,   183,   177,   181,   178,   158,   162,
    48,    50,   216,     0,    78,     0,    52,     0,    79,    80,
   199,   198,     0,   267,     0,   205,   201,   203,     0,   124,
   272,   150,   196,   266,   280,   281,   282,   196,   283,   284,
   270,     0,   271,     0,     0,    28,   214,     0,     0,   123,
   135,     0,   131,   129,     0,     0,   142,     0,   166,   185,
     0,     0,     0,    72,   113,     0,   227,   230,     0,     0,
     0,     0,     0,     0,     0,     0,   255,   254,     0,     0,
   210,     0,   222,   226,   207,   136,   170,    69,   274,   273,
   202,   200,   268,     0,   200,   277,   279,   286,   215,    94,
    95,   132,     0,    20,   126,    24,   184,   182,   218,     0,
     0,     0,   257,     0,     0,   241,   243,   244,   245,     0,
     0,   256,     0,   252,   223,     0,     0,   219,   209,   208,
   224,     0,     0,   149,   146,   148,     0,   133,     0,     0,
     0,     0,     0,     0,   239,     0,   246,   251,     0,     0,
   217,     0,   137,    53,   147,   134,   220,     0,   231,   233,
   237,     0,   242,     0,   253,   225,     0,   228,     0,   257,
     0,   240,   259,     0,   221,     0,     0,     0,   238,     0,
     0,   260,   261,   247,   229,     0,   234,     0,   259,     0,
     0,     0,   257,     0,     0,   248,   262,   232,     0,   263,
     0,     0,   235,   264,     0,   249,     0,     0,     0,   236,
   250,   265,     0,     0,     0
};

static const short yydefgoto[] = {   493,
     1,     2,     3,    15,    16,    17,   193,   335,   199,   338,
    92,   263,   359,    72,   360,   238,    74,    75,    76,    77,
    78,   132,    79,   181,   182,    18,   183,   184,    49,   185,
    80,   165,    21,   108,    97,    39,    93,    98,   336,    40,
   270,   366,   367,   174,   100,   315,   101,    22,   120,   122,
   113,    50,   413,   202,    52,   118,   286,   287,   111,   112,
    82,   163,    83,    84,   164,   362,   407,   186,   294,   326,
   363,   364,   447,   365,   432,   391,   456,   392,   449,   450,
   473,   487,   451,   442,   426,   430,   403,   221,   461,   462,
   463,   485,   243,   244,   176,   177,   256,   304,   257,   258,
   259,   260
};

static const short yypact[] = {    67,
    74,  1428,  1428,   292,-32768,-32768,-32768,-32768,    38,    73,
    79,    61,    92,-32768,-32768,-32768,-32768,   144,     2,   395,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,    88,-32768,
   109,-32768,   114,   174,  1181,-32768,-32768,   144,    36,-32768,
   714,-32768,   203,-32768,-32768,-32768,   144,-32768,   257,    49,
-32768,   801,-32768,  1362,-32768,-32768,    22,-32768,-32768,-32768,
  1248,  1292,-32768,-32768,-32768,  1311,-32768,-32768,   622,-32768,
-32768,  1311,   141,   177,-32768,-32768,  1500,   609,   193,    89,
-32768,   149,  1474,   327,   256,-32768,   203,-32768,   189,-32768,
   854,    59,   215,-32768,-32768,   203,    76,-32768,   839,   328,
   333,   103,   773,   257,-32768,-32768,-32768,-32768,-32768,   222,
   197,-32768,    49,-32768,-32768,-32768,-32768,   204,   414,-32768,
-32768,-32768,-32768,   209,   622,-32768,   622,-32768,-32768,   218,
   221,   238,   250,-32768,-32768,  1311,  1311,  1311,  1311,  1311,
  1311,  1311,  1311,  1311,  1311,  1311,  1311,  1311,  1311,  1311,
  1311,  1311,  1311,-32768,-32768,    49,    49,  1311,  1311,-32768,
    89,   877,-32768,   336,   418,-32768,-32768,-32768,-32768,-32768,
   333,-32768,-32768,   288,   174,-32768,   291,-32768,   254,   268,
-32768,   470,   442,   271,   673,-32768,-32768,   205,   277,-32768,
   203,-32768,    59,   304,-32768,   921,-32768,-32768,    59,  1311,
    49,   279,   197,   125,-32768,   125,  1379,  1396,-32768,   289,
   300,-32768,-32768,   303,   307,  1153,  1500,  1500,  1500,-32768,
   338,  1529,  1541,  1452,  1134,   832,   597,   777,   323,   323,
   295,   295,-32768,-32768,-32768,-32768,-32768,   319,   177,   314,
   358,   298,-32768,   589,-32768,   329,-32768,   944,-32768,   418,
    28,   342,-32768,    85,  1455,-32768,   355,   345,-32768,    24,
-32768,-32768,    32,-32768,-32768,-32768,   203,-32768,   144,   788,
   328,-32768,-32768,-32768,-32768,-32768,-32768,   366,-32768,  1500,
-32768,-32768,   378,  1311,   404,   379,-32768,   379,-32768,-32768,
-32768,-32768,-32768,   502,-32768,   788,-32768,  1311,-32768,-32768,
   336,-32768,   383,-32768,   385,-32768,-32768,-32768,   381,-32768,
-32768,-32768,-32768,   156,   350,   333,-32768,-32768,   333,-32768,
-32768,   529,-32768,   455,   238,-32768,-32768,   199,   219,   190,
-32768,   335,  1500,-32768,    32,   788,-32768,    32,-32768,  1500,
  1311,   125,   359,   439,   440,   424,-32768,-32768,   425,   427,
  1311,   456,   431,   436,  1225,    49,   487,-32768,   462,   461,
  1049,   264,-32768,   496,-32768,-32768,   471,  1516,-32768,-32768,
-32768,    51,-32768,   988,   100,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,   108,-32768,-32768,-32768,  1500,-32768,-32768,  1311,
   483,  1109,  1311,  1311,   505,-32768,-32768,-32768,-32768,   491,
   492,-32768,   490,-32768,-32768,   562,   495,-32768,-32768,-32768,
-32768,   645,   497,   350,-32768,-32768,   504,-32768,   705,   494,
  1311,   537,   501,   512,-32768,  1109,-32768,-32768,   174,  1109,
-32768,  1109,-32768,-32768,-32768,-32768,-32768,   513,-32768,-32768,
-32768,  1109,-32768,   116,-32768,-32768,  1109,-32768,   506,  1311,
  1109,-32768,   563,   517,-32768,  1109,  1311,   518,-32768,   522,
     6,   531,-32768,-32768,-32768,   541,-32768,  1311,   563,   521,
   563,   542,  1311,   548,    14,-32768,-32768,-32768,   552,-32768,
   600,   553,-32768,-32768,    70,-32768,  1109,   556,   605,-32768,
-32768,-32768,   598,   615,-32768
};

static const short yypgoto[] = {-32768,
-32768,-32768,-32768,   624,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,    -5,-32768,   -35,-32768,   460,   373,   -48,    78,
-32768,-32768,   -33,  -142,   353,     1,  -167,     5,   584,     7,
   -16,   481,    -8,  -137,   388,   -34,   -64,   -68,-32768,-32768,
-32768,  -245,   320,   -41,   -66,   285,   -15,    -9,-32768,-32768,
-32768,-32768,-32768,   465,    -6,-32768,   463,   331,   557,   474,
   -26,   -67,    -4,   -81,  -139,   330,-32768,  -172,-32768,  -157,
   -83,-32768,-32768,  -294,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,  -364,   223,-32768,
   225,-32768,   446,-32768,  -178,-32768,-32768,-32768,   453,-32768,
   376,-32768
};


#define	YYLAST		1588


static const short yytable[] = {    73,
    57,    99,    41,    29,    31,    33,    19,    19,    20,    20,
   265,    48,   102,   188,   264,   169,   276,   129,   173,    43,
    47,   242,    85,   134,   334,    54,    81,   249,   423,   189,
   123,   103,   325,   131,   194,   117,   123,   117,   469,   109,
    26,    27,   133,    81,   110,    81,   481,   119,   215,   119,
   274,    26,    27,    36,   312,   179,   279,   170,    42,   180,
    81,   470,     5,     6,     7,     8,    -1,   410,   171,   482,
     9,    10,    11,    -2,   168,    26,    27,   124,   241,   323,
    85,    26,    27,   310,   324,   458,    13,    36,   312,   131,
   385,   131,    86,   214,   109,   313,    87,   422,   210,    28,
   211,   301,    36,   220,   314,   162,   170,   110,   479,   194,
   168,   410,   249,   207,    34,   208,    81,   204,    81,   206,
   -87,   271,   273,   240,   123,   488,   246,    36,    94,   313,
   489,   443,   190,   160,    30,   445,   191,   446,   314,   162,
    32,   251,   161,   162,   318,    35,    36,   452,   453,    51,
   236,   237,   455,   314,   162,   109,   459,   284,    36,   197,
   278,   465,   285,    87,   285,   418,   433,   297,   419,    95,
    53,   454,   171,   433,   242,    55,    48,   384,    96,   327,
   386,   254,    56,   255,   267,   269,   317,   320,    37,   409,
   117,   117,   490,   264,   415,   110,   135,    38,    81,    81,
   318,   123,   119,   119,   166,    36,    94,    36,    94,   314,
   162,   170,   309,   217,   218,   219,    89,   222,   223,   224,
   225,   226,   227,   228,   229,   230,   231,   232,   233,   234,
   235,   372,   301,   409,   329,   301,   375,   136,   316,   319,
   109,   379,   175,    90,    91,   187,    48,    95,   254,    95,
   255,   327,   200,   330,   327,   380,    96,   201,    96,   191,
   205,   105,   106,   107,   180,   209,   344,    27,     9,    10,
    11,    60,    56,   212,    61,   381,   213,   280,   346,    87,
   347,   348,   349,   350,   351,   352,   353,   354,   355,   356,
   357,   252,    62,   253,     5,     6,     7,     8,    85,   214,
   285,    63,     9,    10,    11,   216,    64,    65,    66,    90,
    91,   172,    67,    68,    89,   395,   261,    69,    13,   400,
   358,   408,    70,    71,   262,   214,   254,   266,   255,    36,
   195,   196,   272,   170,   275,   331,   282,    58,   417,   151,
   152,   153,    60,    56,   291,    61,  -275,   333,    24,    25,
   401,   247,   248,   302,   420,   292,   171,   220,   424,   171,
   293,   340,   295,    62,   170,   149,   150,   151,   152,   153,
   298,    37,    63,   333,   299,   368,   300,    64,    65,    66,
    38,   195,   196,    67,    68,   438,    90,    91,    69,   247,
   248,   306,   382,    70,    71,   444,   332,   311,     5,    44,
     7,    45,   160,   373,   374,   322,     9,    10,    11,   333,
   321,   161,   162,   333,   220,   262,   389,     5,   387,     7,
   167,   466,    13,   106,   107,     9,    10,    11,   337,     9,
    10,    11,   474,   126,   128,   339,   341,   220,   369,   342,
   370,    13,   180,   371,   -89,   -89,   -89,   -89,   -89,   -89,
   -89,    46,   -89,   -89,   -89,   -89,   -89,   378,   -89,   -89,
   -89,   -89,   -89,   -89,   -89,   -89,   -89,   -89,   -89,   -89,
   -89,   -30,   -31,     5,     6,     7,     8,   390,   393,   -89,
   394,     9,    10,    11,   -89,   -89,   -89,   397,   396,   333,
   -89,   -89,   398,   402,   404,   -89,   333,    13,   -89,   -89,
   -89,   -89,   343,   -89,   344,   345,     6,     7,     8,    60,
    56,   411,    61,     9,    10,    11,   346,   405,   347,   348,
   349,   350,   351,   352,   353,   354,   355,   356,   357,    13,
    62,   412,     5,     6,     7,     8,   421,   425,   376,    63,
     9,    10,    11,   429,    64,    65,    66,   427,   428,   437,
    67,    68,   431,   439,   434,    69,    13,   440,   358,   457,
    70,    71,   180,   214,   344,    27,   435,   441,   448,    60,
    56,   460,    61,   464,   467,   468,   346,   476,   347,   348,
   349,   350,   351,   352,   353,   354,   355,   356,   357,   303,
    62,   471,     5,     6,     7,     8,   472,   494,   478,    63,
     9,    10,    11,   480,    64,    65,    66,   483,   484,   486,
    67,    68,   491,   492,   495,    69,    13,   239,   358,  -211,
    70,    71,   130,   214,    58,     5,    23,     7,    59,    60,
    56,   104,    61,     9,    10,    11,   146,   147,   148,   149,
   150,   151,   152,   153,  -275,   331,   361,    58,   250,    13,
    62,   383,    60,    56,   328,    61,   414,   154,   155,    63,
   156,   157,   158,   159,    64,    65,    66,   283,   288,   203,
    67,    68,   388,    62,   281,    69,     5,    44,     7,    45,
    70,    71,    63,   -77,     9,    10,    11,    64,    65,    66,
   406,   475,   307,    67,    68,   477,   305,   377,    69,     0,
    13,     0,  -171,    70,    71,   331,   332,    58,     0,     0,
     0,     0,    60,    56,    88,    61,     0,   -26,   -26,   -26,
   -26,     0,     0,     0,     0,   -26,   -26,   -26,     0,   268,
     0,     0,     0,    62,     0,     0,     0,     0,     0,     0,
    89,   -26,    63,     0,  -123,     0,     0,    64,    65,    66,
     0,     0,     0,    67,    68,     0,     0,     0,    69,     0,
     0,     0,   436,    70,    71,     0,   332,    90,    91,     0,
  -123,     0,     0,   198,  -123,   -26,   -22,   -22,   -22,   -22,
     0,     0,     0,     0,   -22,   -22,   -22,     0,   331,     0,
    58,     0,     0,     0,     0,    60,    56,     0,    61,    89,
   -22,   114,     0,  -123,     5,     0,     7,    59,     0,     0,
     0,     0,     9,    10,    11,     0,    62,   147,   148,   149,
   150,   151,   152,   153,     0,    63,    90,    91,    13,  -123,
    64,    65,    66,  -123,   -22,     0,    67,    68,     0,   192,
     0,    69,   -18,   -18,   -18,   -18,    70,    71,     0,   332,
   -18,   -18,   -18,     0,     0,     0,    58,   115,   116,     0,
     0,    60,    56,     0,    61,    89,   -18,     0,     0,  -123,
   145,   146,   147,   148,   149,   150,   151,   152,   153,    58,
     0,     0,    62,     0,    60,    56,     0,    61,     0,     0,
     0,    63,     0,     0,     0,  -123,    64,    65,    66,  -123,
   -18,     0,    67,    68,     0,    62,     0,    69,     0,     0,
     0,     0,    70,    71,    63,     0,   178,     0,     0,    64,
    65,    66,     0,    58,     0,    67,    68,     0,    60,    56,
    69,    61,     0,     0,     0,    70,    71,     0,     0,   245,
     0,     0,     0,     0,     0,     0,    58,     0,     0,    62,
     0,    60,    56,     0,    61,     0,     0,     0,    63,     0,
     0,     0,     0,    64,    65,    66,     0,     0,     0,    67,
    68,     0,    62,     0,    69,     0,     0,     0,     0,    70,
    71,    63,     0,   277,     0,     0,    64,    65,    66,     0,
    58,     0,    67,    68,     0,    60,    56,    69,    61,     0,
     0,     0,    70,    71,     0,     0,   308,     0,     0,     0,
     0,     0,     0,     0,     0,     0,    62,     0,     0,     0,
     0,     0,     0,     0,     0,    63,     0,     0,     0,     0,
    64,    65,    66,     0,     0,     0,    67,    68,     0,     0,
     0,    69,     0,     0,     0,     0,    70,    71,     0,     0,
   416,   344,   345,     6,     7,     8,    60,    56,     0,    61,
     9,    10,    11,   346,     0,   347,   348,   349,   350,   351,
   352,   353,   354,   355,   356,   357,    13,    62,     0,     0,
     0,     0,     0,     0,     0,     0,    63,     0,     0,     0,
     0,    64,    65,    66,     0,     0,     0,    67,    68,     0,
     0,     0,    69,     0,     0,   358,     0,    70,    71,     0,
   214,   344,    27,     0,     0,     0,    60,    56,     0,    61,
     0,     0,     0,   346,     0,   347,   348,   349,   350,   351,
   352,   353,   354,   355,   356,   357,     0,    62,     0,     0,
     0,     0,     0,     0,     0,     0,    63,     0,     0,     0,
     0,    64,    65,    66,     0,    58,     0,    67,    68,     0,
    60,    56,    69,    61,     0,   358,     0,    70,    71,     0,
   214,   144,   145,   146,   147,   148,   149,   150,   151,   152,
   153,    62,     0,    58,     5,     0,     7,    59,    60,    56,
    63,    61,     9,    10,    11,    64,    65,    66,     0,     0,
     0,    67,    68,     0,     0,     0,    69,     0,    13,    62,
     0,    70,    71,     0,   296,     0,     0,     0,    63,     0,
     0,     0,     0,    64,    65,    66,     0,    58,     0,    67,
    68,     0,    60,    56,    69,    61,     0,     0,     0,    70,
    71,     0,     0,     0,     0,     0,     0,     0,     0,     0,
    58,     0,     0,    62,     0,    60,    56,     0,    61,     0,
     0,     0,    63,     0,     0,     0,     0,    64,    65,    66,
     0,     0,     0,    67,    68,     0,    62,     0,    69,     0,
     0,   399,     0,    70,    71,    63,     0,     0,     0,     0,
    64,    65,    66,     0,    58,     0,    67,    68,     0,    60,
    56,   125,    61,     0,     0,     0,    70,    71,     0,     0,
     0,     0,     0,    58,     0,     0,     0,     0,    60,    56,
    62,    61,     0,     0,     0,     0,     0,     0,     0,    63,
     0,     0,     0,     0,    64,    65,    66,     0,     0,    62,
    67,    68,     0,     0,     0,   127,     0,     0,    63,     0,
    70,    71,     0,    64,    65,    66,     0,     0,     0,    67,
    68,     0,   114,     0,    69,     5,     0,     7,    59,    70,
    71,     0,     0,     9,    10,    11,     0,     0,     0,   114,
     0,     0,     5,     0,     7,    59,     0,     0,     0,    13,
     9,    10,    11,     0,     0,     0,   114,     0,     0,     5,
     0,     7,    59,     0,     0,     0,    13,     9,    10,    11,
     0,     0,     0,     0,     0,     0,     0,     0,   115,   121,
     0,     0,     0,    13,     0,     0,     0,     0,     4,     0,
   -93,     5,     6,     7,     8,   115,   289,     0,     0,     9,
    10,    11,     0,     0,     0,     0,     0,     0,     0,     0,
     0,     0,   115,   290,    12,    13,     0,    36,     5,    44,
     7,    45,     0,     0,     0,     0,     9,    10,    11,     0,
     0,     0,   -93,     0,     0,     0,     0,     5,     0,     7,
   167,   -93,    13,     0,    14,     9,    10,    11,   143,   144,
   145,   146,   147,   148,   149,   150,   151,   152,   153,   318,
     0,    13,     0,     0,     0,     0,     0,     0,   314,   162,
     0,     0,     0,     0,     0,     0,     0,     0,   160,     0,
     0,     0,     0,     0,     0,     0,     0,   161,   162,   137,
   138,   139,     0,   140,   141,   142,   143,   144,   145,   146,
   147,   148,   149,   150,   151,   152,   153,   139,     0,   140,
   141,   142,   143,   144,   145,   146,   147,   148,   149,   150,
   151,   152,   153,   141,   142,   143,   144,   145,   146,   147,
   148,   149,   150,   151,   152,   153,   142,   143,   144,   145,
   146,   147,   148,   149,   150,   151,   152,   153
};

static const short yycheck[] = {    35,
    34,    43,    18,     9,    10,    11,     2,     3,     2,     3,
   183,    20,    47,    95,   182,    83,   195,    66,    87,    19,
    20,   161,    38,    72,   270,    32,    35,   165,   393,    96,
     9,    47,     1,    69,    99,    52,     9,    54,    33,    49,
     3,     4,    69,    52,    50,    54,    33,    52,   132,    54,
   193,     3,     4,     3,     4,    91,   199,     7,    57,     1,
    69,    56,     4,     5,     6,     7,     0,   362,    84,    56,
    12,    13,    14,     0,    83,     3,     4,    56,   160,    56,
    96,     3,     4,    56,    61,   450,    28,     3,     4,   125,
   336,   127,    57,    62,   104,    45,    61,   392,   125,    62,
   127,   241,     3,   139,    54,    55,     7,   113,   473,   174,
   119,   406,   250,   120,    54,   122,   125,   117,   127,   119,
    62,   188,   191,   159,     9,    56,   162,     3,     4,    45,
    61,   426,    57,    45,    62,   430,    61,   432,    54,    55,
    62,   175,    54,    55,    45,    54,     3,   442,    33,    62,
   156,   157,   447,    54,    55,   165,   451,    33,     3,    57,
   196,   456,   204,    61,   206,    58,   412,   216,    61,    45,
    62,    56,   188,   419,   314,    62,   185,   335,    54,   263,
   338,   177,     9,   177,   184,   185,   254,   255,    45,   362,
   207,   208,   487,   361,   373,   201,    56,    54,   207,   208,
    45,     9,   207,   208,    56,     3,     4,     3,     4,    54,
    55,     7,   248,   136,   137,   138,    27,   140,   141,   142,
   143,   144,   145,   146,   147,   148,   149,   150,   151,   152,
   153,   313,   372,   406,   269,   375,   318,    61,   254,   255,
   250,   325,    54,    54,    55,    31,   255,    45,   244,    45,
   244,   335,    31,   269,   338,    57,    54,    61,    54,    61,
    57,     5,     6,     7,     1,    57,     3,     4,    12,    13,
    14,     8,     9,    56,    11,    57,    56,   200,    15,    61,
    17,    18,    19,    20,    21,    22,    23,    24,    25,    26,
    27,     1,    29,     3,     4,     5,     6,     7,   314,    62,
   342,    38,    12,    13,    14,    56,    43,    44,    45,    54,
    55,    56,    49,    50,    27,   351,    63,    54,    28,   355,
    57,    58,    59,    60,    57,    62,   322,    57,   322,     3,
    54,    55,    56,     7,    31,     1,    58,     3,   374,    45,
    46,    47,     8,     9,    56,    11,    56,   270,    57,    58,
   356,    54,    55,    56,   390,    56,   372,   393,   394,   375,
    58,   284,    56,    29,     7,    43,    44,    45,    46,    47,
    33,    45,    38,   296,    56,   298,    63,    43,    44,    45,
    54,    54,    55,    49,    50,   421,    54,    55,    54,    54,
    55,    63,    58,    59,    60,   429,    62,    56,     4,     5,
     6,     7,    45,    54,    55,    61,    12,    13,    14,   332,
    56,    54,    55,   336,   450,    57,    58,     4,   341,     6,
     7,   457,    28,     6,     7,    12,    13,    14,    63,    12,
    13,    14,   468,    61,    62,    58,    33,   473,    56,    61,
    56,    28,     1,    63,     3,     4,     5,     6,     7,     8,
     9,    57,    11,    12,    13,    14,    15,     3,    17,    18,
    19,    20,    21,    22,    23,    24,    25,    26,    27,    28,
    29,    33,    33,     4,     5,     6,     7,    54,    54,    38,
    54,    12,    13,    14,    43,    44,    45,    57,    33,   412,
    49,    50,    57,     7,    33,    54,   419,    28,    57,    58,
    59,    60,     1,    62,     3,     4,     5,     6,     7,     8,
     9,    16,    11,    12,    13,    14,    15,    57,    17,    18,
    19,    20,    21,    22,    23,    24,    25,    26,    27,    28,
    29,    61,     4,     5,     6,     7,    54,    33,    10,    38,
    12,    13,    14,    54,    43,    44,    45,    57,    57,    56,
    49,    50,    58,    17,    58,    54,    28,    57,    57,    54,
    59,    60,     1,    62,     3,     4,    63,    56,    56,     8,
     9,     9,    11,    57,    57,    54,    15,    57,    17,    18,
    19,    20,    21,    22,    23,    24,    25,    26,    27,     1,
    29,    61,     4,     5,     6,     7,    56,     0,    57,    38,
    12,    13,    14,    56,    43,    44,    45,    56,     9,    57,
    49,    50,    57,     9,     0,    54,    28,   158,    57,    58,
    59,    60,     1,    62,     3,     4,     3,     6,     7,     8,
     9,    48,    11,    12,    13,    14,    40,    41,    42,    43,
    44,    45,    46,    47,    56,     1,   294,     3,   168,    28,
    29,   332,     8,     9,   267,    11,   372,    49,    50,    38,
    52,    53,    54,    55,    43,    44,    45,   203,   206,   113,
    49,    50,   342,    29,   201,    54,     4,     5,     6,     7,
    59,    60,    38,    62,    12,    13,    14,    43,    44,    45,
   361,   469,   247,    49,    50,   471,   244,   322,    54,    -1,
    28,    -1,    58,    59,    60,     1,    62,     3,    -1,    -1,
    -1,    -1,     8,     9,     1,    11,    -1,     4,     5,     6,
     7,    -1,    -1,    -1,    -1,    12,    13,    14,    -1,    57,
    -1,    -1,    -1,    29,    -1,    -1,    -1,    -1,    -1,    -1,
    27,    28,    38,    -1,    31,    -1,    -1,    43,    44,    45,
    -1,    -1,    -1,    49,    50,    -1,    -1,    -1,    54,    -1,
    -1,    -1,    58,    59,    60,    -1,    62,    54,    55,    -1,
    57,    -1,    -1,     1,    61,    62,     4,     5,     6,     7,
    -1,    -1,    -1,    -1,    12,    13,    14,    -1,     1,    -1,
     3,    -1,    -1,    -1,    -1,     8,     9,    -1,    11,    27,
    28,     1,    -1,    31,     4,    -1,     6,     7,    -1,    -1,
    -1,    -1,    12,    13,    14,    -1,    29,    41,    42,    43,
    44,    45,    46,    47,    -1,    38,    54,    55,    28,    57,
    43,    44,    45,    61,    62,    -1,    49,    50,    -1,     1,
    -1,    54,     4,     5,     6,     7,    59,    60,    -1,    62,
    12,    13,    14,    -1,    -1,    -1,     3,    57,    58,    -1,
    -1,     8,     9,    -1,    11,    27,    28,    -1,    -1,    31,
    39,    40,    41,    42,    43,    44,    45,    46,    47,     3,
    -1,    -1,    29,    -1,     8,     9,    -1,    11,    -1,    -1,
    -1,    38,    -1,    -1,    -1,    57,    43,    44,    45,    61,
    62,    -1,    49,    50,    -1,    29,    -1,    54,    -1,    -1,
    -1,    -1,    59,    60,    38,    -1,    63,    -1,    -1,    43,
    44,    45,    -1,     3,    -1,    49,    50,    -1,     8,     9,
    54,    11,    -1,    -1,    -1,    59,    60,    -1,    -1,    63,
    -1,    -1,    -1,    -1,    -1,    -1,     3,    -1,    -1,    29,
    -1,     8,     9,    -1,    11,    -1,    -1,    -1,    38,    -1,
    -1,    -1,    -1,    43,    44,    45,    -1,    -1,    -1,    49,
    50,    -1,    29,    -1,    54,    -1,    -1,    -1,    -1,    59,
    60,    38,    -1,    63,    -1,    -1,    43,    44,    45,    -1,
     3,    -1,    49,    50,    -1,     8,     9,    54,    11,    -1,
    -1,    -1,    59,    60,    -1,    -1,    63,    -1,    -1,    -1,
    -1,    -1,    -1,    -1,    -1,    -1,    29,    -1,    -1,    -1,
    -1,    -1,    -1,    -1,    -1,    38,    -1,    -1,    -1,    -1,
    43,    44,    45,    -1,    -1,    -1,    49,    50,    -1,    -1,
    -1,    54,    -1,    -1,    -1,    -1,    59,    60,    -1,    -1,
    63,     3,     4,     5,     6,     7,     8,     9,    -1,    11,
    12,    13,    14,    15,    -1,    17,    18,    19,    20,    21,
    22,    23,    24,    25,    26,    27,    28,    29,    -1,    -1,
    -1,    -1,    -1,    -1,    -1,    -1,    38,    -1,    -1,    -1,
    -1,    43,    44,    45,    -1,    -1,    -1,    49,    50,    -1,
    -1,    -1,    54,    -1,    -1,    57,    -1,    59,    60,    -1,
    62,     3,     4,    -1,    -1,    -1,     8,     9,    -1,    11,
    -1,    -1,    -1,    15,    -1,    17,    18,    19,    20,    21,
    22,    23,    24,    25,    26,    27,    -1,    29,    -1,    -1,
    -1,    -1,    -1,    -1,    -1,    -1,    38,    -1,    -1,    -1,
    -1,    43,    44,    45,    -1,     3,    -1,    49,    50,    -1,
     8,     9,    54,    11,    -1,    57,    -1,    59,    60,    -1,
    62,    38,    39,    40,    41,    42,    43,    44,    45,    46,
    47,    29,    -1,     3,     4,    -1,     6,     7,     8,     9,
    38,    11,    12,    13,    14,    43,    44,    45,    -1,    -1,
    -1,    49,    50,    -1,    -1,    -1,    54,    -1,    28,    29,
    -1,    59,    60,    -1,    62,    -1,    -1,    -1,    38,    -1,
    -1,    -1,    -1,    43,    44,    45,    -1,     3,    -1,    49,
    50,    -1,     8,     9,    54,    11,    -1,    -1,    -1,    59,
    60,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
     3,    -1,    -1,    29,    -1,     8,     9,    -1,    11,    -1,
    -1,    -1,    38,    -1,    -1,    -1,    -1,    43,    44,    45,
    -1,    -1,    -1,    49,    50,    -1,    29,    -1,    54,    -1,
    -1,    57,    -1,    59,    60,    38,    -1,    -1,    -1,    -1,
    43,    44,    45,    -1,     3,    -1,    49,    50,    -1,     8,
     9,    54,    11,    -1,    -1,    -1,    59,    60,    -1,    -1,
    -1,    -1,    -1,     3,    -1,    -1,    -1,    -1,     8,     9,
    29,    11,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    38,
    -1,    -1,    -1,    -1,    43,    44,    45,    -1,    -1,    29,
    49,    50,    -1,    -1,    -1,    54,    -1,    -1,    38,    -1,
    59,    60,    -1,    43,    44,    45,    -1,    -1,    -1,    49,
    50,    -1,     1,    -1,    54,     4,    -1,     6,     7,    59,
    60,    -1,    -1,    12,    13,    14,    -1,    -1,    -1,     1,
    -1,    -1,     4,    -1,     6,     7,    -1,    -1,    -1,    28,
    12,    13,    14,    -1,    -1,    -1,     1,    -1,    -1,     4,
    -1,     6,     7,    -1,    -1,    -1,    28,    12,    13,    14,
    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    57,    58,
    -1,    -1,    -1,    28,    -1,    -1,    -1,    -1,     1,    -1,
     3,     4,     5,     6,     7,    57,    58,    -1,    -1,    12,
    13,    14,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
    -1,    -1,    57,    58,    27,    28,    -1,     3,     4,     5,
     6,     7,    -1,    -1,    -1,    -1,    12,    13,    14,    -1,
    -1,    -1,    45,    -1,    -1,    -1,    -1,     4,    -1,     6,
     7,    54,    28,    -1,    57,    12,    13,    14,    37,    38,
    39,    40,    41,    42,    43,    44,    45,    46,    47,    45,
    -1,    28,    -1,    -1,    -1,    -1,    -1,    -1,    54,    55,
    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    45,    -1,
    -1,    -1,    -1,    -1,    -1,    -1,    -1,    54,    55,    30,
    31,    32,    -1,    34,    35,    36,    37,    38,    39,    40,
    41,    42,    43,    44,    45,    46,    47,    32,    -1,    34,
    35,    36,    37,    38,    39,    40,    41,    42,    43,    44,
    45,    46,    47,    35,    36,    37,    38,    39,    40,    41,
    42,    43,    44,    45,    46,    47,    36,    37,    38,    39,
    40,    41,    42,    43,    44,    45,    46,    47
};
#define YYPURE 1

/* -*-C-*-  Note some compilers choke on comments on `#line' lines.  */
#line 3 "bison.simple"

/* Skeleton output parser for bison,
   copyright (C) 1984 Bob Corbett and Richard Stallman

		       NO WARRANTY

  BECAUSE THIS PROGRAM IS LICENSED FREE OF CHARGE, WE PROVIDE ABSOLUTELY
NO WARRANTY, TO THE EXTENT PERMITTED BY APPLICABLE STATE LAW.  EXCEPT
WHEN OTHERWISE STATED IN WRITING, FREE SOFTWARE FOUNDATION, INC,
RICHARD M. STALLMAN AND/OR OTHER PARTIES PROVIDE THIS PROGRAM "AS IS"
WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,
BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY
AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE PROGRAM PROVE
DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR
CORRECTION.

 IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW WILL RICHARD M.
STALLMAN, THE FREE SOFTWARE FOUNDATION, INC., AND/OR ANY OTHER PARTY
WHO MAY MODIFY AND REDISTRIBUTE THIS PROGRAM AS PERMITTED BELOW, BE
LIABLE TO YOU FOR DAMAGES, INCLUDING ANY LOST PROFITS, LOST MONIES, OR
OTHER SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
USE OR INABILITY TO USE (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR
DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY THIRD PARTIES OR
A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS) THIS
PROGRAM, EVEN IF YOU HAVE BEEN ADVISED OF THE POSSIBILITY OF SUCH
DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY.

		GENERAL PUBLIC LICENSE TO COPY

  1. You may copy and distribute verbatim copies of this source file
as you receive it, in any medium, provided that you conspicuously and
appropriately publish on each copy a valid copyright notice "Copyright
(C) 1985 Free Software Foundation, Inc."; and include following the
copyright notice a verbatim copy of the above disclaimer of warranty
and of this License.  You may charge a distribution fee for the
physical act of transferring a copy.

  2. You may modify your copy or copies of this source file or
any portion of it, and copy and distribute such modifications under
the terms of Paragraph 1 above, provided that you also do the following:

    a) cause the modified files to carry prominent notices stating
    that you changed the files and the date of any change; and

    b) cause the whole of any work that you distribute or publish,
    that in whole or in part contains or is a derivative of this
    program or any part thereof, to be licensed at no charge to all
    third parties on terms identical to those contained in this
    License Agreement (except that you may choose to grant more extensive
    warranty protection to some or all third parties, at your option).

    c) You may charge a distribution fee for the physical act of
    transferring a copy, and you may at your option offer warranty
    protection in exchange for a fee.

Mere aggregation of another unrelated program with this program (or its
derivative) on a volume of a storage or distribution medium does not bring
the other program under the scope of these terms.

  3. You may copy and distribute this program (or a portion or derivative
of it, under Paragraph 2) in object code or executable form under the terms
of Paragraphs 1 and 2 above provided that you also do one of the following:

    a) accompany it with the complete corresponding machine-readable
    source code, which must be distributed under the terms of
    Paragraphs 1 and 2 above; or,

    b) accompany it with a written offer, valid for at least three
    years, to give any third party free (except for a nominal
    shipping charge) a complete machine-readable copy of the
    corresponding source code, to be distributed under the terms of
    Paragraphs 1 and 2 above; or,

    c) accompany it with the information you received as to where the
    corresponding source code may be obtained.  (This alternative is
    allowed only for noncommercial distribution and only if you
    received the program in object code or executable form alone.)

For an executable file, complete source code means all the source code for
all modules it contains; but, as a special exception, it need not include
source code for modules which are standard libraries that accompany the
operating system on which the executable file runs.

  4. You may not copy, sublicense, distribute or transfer this program
except as expressly provided under this License Agreement.  Any attempt
otherwise to copy, sublicense, distribute or transfer this program is void and
your rights to use the program under this License agreement shall be
automatically terminated.  However, parties who have received computer
software programs from you with this License Agreement will not have
their licenses terminated so long as such parties remain in full compliance.

  5. If you wish to incorporate parts of this program into other free
programs whose distribution conditions are different, write to the Free
Software Foundation at 675 Mass Ave, Cambridge, MA 02139.  We have not yet
worked out a simple rule that can be stated here, but we will often permit
this.  We will be guided by the two goals of preserving the free status of
all derivatives of our free software and of promoting the sharing and reuse of
software.


In other words, you are welcome to use, share and improve this program.
You are forbidden to forbid anyone else to use, share and improve
what you give them.   Help stamp out software-hoarding!  */

#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__)
#include <alloca.h>
#endif

/* This is the parser code that is written into each bison parser
  when the %semantic_parser declaration is not specified in the grammar.
  It was written by Richard Stallman by simplifying the hairy parser
  used when %semantic_parser is specified.  */

/* Note: there must be only one dollar sign in this file.
   It is replaced by the list of actions, each action
   as one case of the switch.  */

#define yyerrok		(yyerrstatus = 0)
#define yyclearin	(yychar = YYEMPTY)
#define YYEMPTY		-2
#define YYEOF		0
#define YYFAIL		goto yyerrlab;
#define YYACCEPT	return(0)
#define YYABORT 	return(1)
#define YYERROR		goto yyerrlab

#define YYTERROR	1

#ifndef YYIMPURE
#define YYLEX		yylex()
#endif

#ifndef YYPURE
#define YYLEX		yylex(&yylval, &yylloc)
#endif

/* If nonreentrant, generate the variables here */

#ifndef YYIMPURE

int	yychar;			/*  the lookahead symbol		*/
YYSTYPE	yylval;			/*  the semantic value of the		*/
				/*  lookahead symbol			*/

YYLTYPE yylloc;			/*  location data for the lookahead	*/
				/*  symbol				*/

int yynerrs;			/*  number of parse errors so far       */
#endif  /* YYIMPURE */

#if YYDEBUG != 0
int yydebug;			/*  nonzero means print parse trace	*/
/* Since this is uninitialized, it does not stop multiple parsers
   from coexisting.  */
#endif

/*  YYMAXDEPTH indicates the initial size of the parser's stacks	*/

#ifndef	YYMAXDEPTH
#define YYMAXDEPTH 200
#endif

/*  YYMAXLIMIT is the maximum size the stacks can grow to
    (effective only if the built-in stack extension method is used).  */

#ifndef YYMAXLIMIT
#define YYMAXLIMIT 10000
#endif


#line 175 "bison.simple"
int
yyparse()
{
  register int yystate;
  register int yyn;
  register short *yyssp;
  register YYSTYPE *yyvsp;
  YYLTYPE *yylsp;
  int yyerrstatus;	/*  number of tokens to shift before error messages enabled */
  int yychar1;		/*  lookahead token as an internal (translated) token number */

  short	yyssa[YYMAXDEPTH];	/*  the state stack			*/
  YYSTYPE yyvsa[YYMAXDEPTH];	/*  the semantic value stack		*/
  YYLTYPE yylsa[YYMAXDEPTH];	/*  the location stack			*/

  short *yyss = yyssa;		/*  refer to the stacks thru separate pointers */
  YYSTYPE *yyvs = yyvsa;	/*  to allow yyoverflow to reallocate them elsewhere */
  YYLTYPE *yyls = yylsa;

  int yymaxdepth = YYMAXDEPTH;

#ifndef YYPURE
  int yychar;
  YYSTYPE yylval;
  YYLTYPE yylloc;
  int yynerrs;
#endif

  YYSTYPE yyval;		/*  the variable used to return		*/
				/*  semantic values from the action	*/
				/*  routines				*/

  int yylen;

#if YYDEBUG != 0
  if (yydebug)
    fprintf(stderr, "Starting parse\n");
#endif

  yystate = 0;
  yyerrstatus = 0;
  yynerrs = 0;
  yychar = YYEMPTY;		/* Cause a token to be read.  */

  /* Initialize stack pointers.
     Waste one element of value and location stack
     so that they stay on the same level as the state stack.  */

  yyssp = yyss - 1;
  yyvsp = yyvs;
  yylsp = yyls;

/* Push a new state, which is found in  yystate  .  */
/* In all cases, when you get here, the value and location stacks
   have just been pushed. so pushing a state here evens the stacks.  */
yynewstate:

  *++yyssp = yystate;

  if (yyssp >= yyss + yymaxdepth - 1)
    {
      /* Give user a chance to reallocate the stack */
      /* Use copies of these so that the &'s don't force the real ones into memory. */
      YYSTYPE *yyvs1 = yyvs;
      YYLTYPE *yyls1 = yyls;
      short *yyss1 = yyss;

      /* Get the current used size of the three stacks, in elements.  */
      int size = yyssp - yyss + 1;

#ifdef yyoverflow
      /* Each stack pointer address is followed by the size of
	 the data in use in that stack, in bytes.  */
      yyoverflow("parser stack overflow",
		 &yyss1, size * sizeof (*yyssp),
		 &yyvs1, size * sizeof (*yyvsp),
		 &yyls1, size * sizeof (*yylsp),
		 &yymaxdepth);

      yyss = yyss1; yyvs = yyvs1; yyls = yyls1;
#else /* no yyoverflow */
      /* Extend the stack our own way.  */
      if (yymaxdepth >= YYMAXLIMIT)
	yyerror("parser stack overflow");
      yymaxdepth *= 2;
      if (yymaxdepth > YYMAXLIMIT)
	yymaxdepth = YYMAXLIMIT;
      yyss = (short *) alloca (yymaxdepth * sizeof (*yyssp));
      bcopy ((char *)yyss1, (char *)yyss, size * sizeof (*yyssp));
      yyvs = (YYSTYPE *) alloca (yymaxdepth * sizeof (*yyvsp));
      bcopy ((char *)yyvs1, (char *)yyvs, size * sizeof (*yyvsp));
#ifdef YYLSP_NEEDED
      yyls = (YYLTYPE *) alloca (yymaxdepth * sizeof (*yylsp));
      bcopy ((char *)yyls1, (char *)yyls, size * sizeof (*yylsp));
#endif
#endif /* no yyoverflow */

      yyssp = yyss + size - 1;
      yyvsp = yyvs + size - 1;
#ifdef YYLSP_NEEDED
      yylsp = yyls + size - 1;
#endif

#if YYDEBUG != 0
      if (yydebug)
	fprintf(stderr, "Stack size increased to %d\n", yymaxdepth);
#endif

      if (yyssp >= yyss + yymaxdepth - 1)
	YYABORT;
    }

#if YYDEBUG != 0
  if (yydebug)
    fprintf(stderr, "Entering state %d\n", yystate);
#endif

/* Do appropriate processing given the current state.  */
/* Read a lookahead token if we need one and don't already have one.  */
yyresume:

  /* First try to decide what to do without reference to lookahead token.  */

  yyn = yypact[yystate];
  if (yyn == YYFLAG)
    goto yydefault;

  /* Not known => get a lookahead token if don't already have one.  */

  /* yychar is either YYEMPTY or YYEOF
     or a valid token in external form.  */

  if (yychar == YYEMPTY)
    {
#if YYDEBUG != 0
      if (yydebug)
	fprintf(stderr, "Reading a token: ");
#endif
      yychar = YYLEX;
    }

  /* Convert token to internal form (in yychar1) for indexing tables with */

  if (yychar <= 0)		/* This means end of input. */
    {
      yychar1 = 0;
      yychar = YYEOF;		/* Don't call YYLEX any more */

#if YYDEBUG != 0
      if (yydebug)
	fprintf(stderr, "Now at end of input.\n");
#endif
    }
  else
    {
      yychar1 = YYTRANSLATE(yychar);

#if YYDEBUG != 0
      if (yydebug)
	fprintf(stderr, "Next token is %d (%s)\n", yychar, yytname[yychar1]);
#endif
    }

  yyn += yychar1;
  if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1)
    goto yydefault;

  yyn = yytable[yyn];

  /* yyn is what to do for this token type in this state.
     Negative => reduce, -yyn is rule number.
     Positive => shift, yyn is new state.
       New state is final state => don't bother to shift,
       just return success.
     0, or most negative number => error.  */

  if (yyn < 0)
    {
      if (yyn == YYFLAG)
	goto yyerrlab;
      yyn = -yyn;
      goto yyreduce;
    }
  else if (yyn == 0)
    goto yyerrlab;

  if (yyn == YYFINAL)
    YYACCEPT;

  /* Shift the lookahead token.  */

#if YYDEBUG != 0
  if (yydebug)
    fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]);
#endif

  /* Discard the token being shifted unless it is eof.  */
  if (yychar != YYEOF)
    yychar = YYEMPTY;

  *++yyvsp = yylval;
#ifdef YYLSP_NEEDED
  *++yylsp = yylloc;
#endif

  /* count tokens shifted since error; after three, turn off error status.  */
  if (yyerrstatus) yyerrstatus--;

  yystate = yyn;
  goto yynewstate;

/* Do the default action for the current state.  */
yydefault:

  yyn = yydefact[yystate];
  if (yyn == 0)
    goto yyerrlab;

/* Do a reduction.  yyn is the number of a rule to reduce with.  */
yyreduce:
  yylen = yyr2[yyn];
  yyval = yyvsp[1-yylen]; /* implement default value of the action */

#if YYDEBUG != 0
  if (yydebug)
    {
      if (yylen == 1)
	fprintf (stderr, "Reducing 1 value via line %d, ",
		 yyrline[yyn]);
      else
	fprintf (stderr, "Reducing %d values via line %d, ",
		 yylen, yyrline[yyn]);
    }
#endif


  switch (yyn) {

case 3:
#line 188 "c-parse.y"
{yyval.ttype = NULL_TREE; ;
    break;}
case 5:
#line 189 "c-parse.y"
{yyval.ttype = NULL_TREE; ;
    break;}
case 9:
#line 196 "c-parse.y"
{ if (pedantic)
		    warning ("ANSI C forbids use of `asm' keyword");
		  if (TREE_CHAIN (yyvsp[-2].ttype)) yyvsp[-2].ttype = combine_strings (yyvsp[-2].ttype);
		  assemble_asm (yyvsp[-2].ttype); ;
    break;}
case 10:
#line 204 "c-parse.y"
{ if (pedantic)
		    error ("ANSI C forbids data definition lacking type or storage class");
		  else if (!flag_traditional)
		    warning ("data definition lacks type or storage class"); ;
    break;}
case 11:
#line 209 "c-parse.y"
{;
    break;}
case 12:
#line 211 "c-parse.y"
{;
    break;}
case 13:
#line 213 "c-parse.y"
{ error ("empty declaration"); ;
    break;}
case 14:
#line 215 "c-parse.y"
{ shadow_tag (yyvsp[-1].ttype); ;
    break;}
case 18:
#line 223 "c-parse.y"
{ if (! start_function (yyvsp[-2].ttype, yyvsp[0].ttype))
		    YYERROR;
		  reinit_parse_for_function (); ;
    break;}
case 19:
#line 227 "c-parse.y"
{ store_parm_decls (); ;
    break;}
case 20:
#line 229 "c-parse.y"
{ finish_function (); ;
    break;}
case 21:
#line 231 "c-parse.y"
{ ;
    break;}
case 22:
#line 233 "c-parse.y"
{ if (! start_function (yyvsp[-2].ttype, yyvsp[0].ttype))
		    YYERROR;
		  reinit_parse_for_function (); ;
    break;}
case 23:
#line 237 "c-parse.y"
{ store_parm_decls (); ;
    break;}
case 24:
#line 239 "c-parse.y"
{ finish_function (); ;
    break;}
case 25:
#line 241 "c-parse.y"
{ ;
    break;}
case 26:
#line 243 "c-parse.y"
{ if (! start_function (0, yyvsp[0].ttype))
		    YYERROR;
		  reinit_parse_for_function (); ;
    break;}
case 27:
#line 247 "c-parse.y"
{ store_parm_decls (); ;
    break;}
case 28:
#line 249 "c-parse.y"
{ finish_function (); ;
    break;}
case 29:
#line 251 "c-parse.y"
{ ;
    break;}
case 32:
#line 260 "c-parse.y"
{ yyval.code = ADDR_EXPR; ;
    break;}
case 33:
#line 262 "c-parse.y"
{ yyval.code = NEGATE_EXPR; ;
    break;}
case 34:
#line 264 "c-parse.y"
{ yyval.code = CONVERT_EXPR; ;
    break;}
case 35:
#line 266 "c-parse.y"
{ yyval.code = PREINCREMENT_EXPR; ;
    break;}
case 36:
#line 268 "c-parse.y"
{ yyval.code = PREDECREMENT_EXPR; ;
    break;}
case 37:
#line 270 "c-parse.y"
{ yyval.code = BIT_NOT_EXPR; ;
    break;}
case 38:
#line 272 "c-parse.y"
{ yyval.code = TRUTH_NOT_EXPR; ;
    break;}
case 39:
#line 276 "c-parse.y"
{ yyval.ttype = build_compound_expr (yyvsp[0].ttype); ;
    break;}
case 40:
#line 281 "c-parse.y"
{ yyval.ttype = NULL_TREE; ;
    break;}
case 42:
#line 287 "c-parse.y"
{ yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); ;
    break;}
case 43:
#line 289 "c-parse.y"
{ chainon (yyvsp[-2].ttype, build_tree_list (NULL_TREE, yyvsp[0].ttype)); ;
    break;}
case 45:
#line 295 "c-parse.y"
{ yyval.ttype = build_indirect_ref (yyvsp[0].ttype, "unary *"); ;
    break;}
case 46:
#line 297 "c-parse.y"
{ yyval.ttype = build_unary_op (yyvsp[-1].code, yyvsp[0].ttype, 0); ;
    break;}
case 47:
#line 299 "c-parse.y"
{ if (TREE_CODE (yyvsp[0].ttype) == COMPONENT_REF
		      && TREE_PACKED (TREE_OPERAND (yyvsp[0].ttype, 1)))
		    error ("`sizeof' applied to a bit-field");
		  yyval.ttype = c_sizeof (TREE_TYPE (yyvsp[0].ttype)); ;
    break;}
case 48:
#line 304 "c-parse.y"
{ yyval.ttype = c_sizeof (groktypename (yyvsp[-1].ttype)); ;
    break;}
case 49:
#line 306 "c-parse.y"
{ if (TREE_CODE (yyvsp[0].ttype) == COMPONENT_REF
		      && TREE_PACKED (TREE_OPERAND (yyvsp[0].ttype, 1)))
		    error ("`__alignof' applied to a bit-field");
		  yyval.ttype = c_alignof (TREE_TYPE (yyvsp[0].ttype)); ;
    break;}
case 50:
#line 311 "c-parse.y"
{ yyval.ttype = c_alignof (groktypename (yyvsp[-1].ttype)); ;
    break;}
case 52:
#line 317 "c-parse.y"
{ tree type = groktypename (yyvsp[-2].ttype);
		  yyval.ttype = build_c_cast (type, yyvsp[0].ttype); ;
    break;}
case 53:
#line 320 "c-parse.y"
{ tree type = groktypename (yyvsp[-5].ttype);
		  if (pedantic)
		    warning ("ANSI C forbids constructor expressions");
		  yyval.ttype = digest_init (type, build_nt (CONSTRUCTOR, NULL_TREE, nreverse (yyvsp[-2].ttype)), 0);
		  if (TREE_CODE (type) == ARRAY_TYPE && TYPE_SIZE (type) == 0)
		    {
		      int failure = complete_array_type (type, yyval.ttype, 1);
		      if (failure)
			abort ();
		    }
		;
    break;}
case 55:
#line 336 "c-parse.y"
{ yyval.ttype = build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 56:
#line 338 "c-parse.y"
{ yyval.ttype = build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 57:
#line 340 "c-parse.y"
{ yyval.ttype = build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 58:
#line 342 "c-parse.y"
{ yyval.ttype = build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 59:
#line 344 "c-parse.y"
{ yyval.ttype = build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 60:
#line 346 "c-parse.y"
{ yyval.ttype = build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 61:
#line 348 "c-parse.y"
{ yyval.ttype = build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 62:
#line 350 "c-parse.y"
{ yyval.ttype = build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 63:
#line 352 "c-parse.y"
{ yyval.ttype = build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 64:
#line 354 "c-parse.y"
{ yyval.ttype = build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 65:
#line 356 "c-parse.y"
{ yyval.ttype = build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 66:
#line 358 "c-parse.y"
{ yyval.ttype = build_binary_op (yyvsp[-1].code, yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 67:
#line 360 "c-parse.y"
{ yyval.ttype = build_binary_op (TRUTH_ANDIF_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 68:
#line 362 "c-parse.y"
{ yyval.ttype = build_binary_op (TRUTH_ORIF_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 69:
#line 364 "c-parse.y"
{ yyval.ttype = build_conditional_expr (yyvsp[-4].ttype, yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 70:
#line 366 "c-parse.y"
{ yyval.ttype = build_modify_expr (yyvsp[-2].ttype, NOP_EXPR, yyvsp[0].ttype); ;
    break;}
case 71:
#line 368 "c-parse.y"
{ yyval.ttype = build_modify_expr (yyvsp[-2].ttype, yyvsp[-1].code, yyvsp[0].ttype); ;
    break;}
case 72:
#line 373 "c-parse.y"
{ yyval.ttype = lastiddecl;
		  if (!yyval.ttype || yyval.ttype == error_mark_node)
		    {
		      if (yychar == YYEMPTY)
			yychar = YYLEX;
		      if (yychar == '(')
			{
			  yyval.ttype = implicitly_declare (yyvsp[0].ttype);
			  assemble_external (yyval.ttype);
			  TREE_USED (yyval.ttype) = 1;
			}
		      else if (current_function_decl == 0)
			{
			  error ("`%s' undeclared, outside of functions",
				 IDENTIFIER_POINTER (yyvsp[0].ttype));
			  yyval.ttype = error_mark_node;
			}
		      else
			{
			  if (IDENTIFIER_GLOBAL_VALUE (yyvsp[0].ttype) != error_mark_node
			      || IDENTIFIER_ERROR_LOCUS (yyvsp[0].ttype) != current_function_decl)
			    {
			      error ("`%s' undeclared (first use this function)",
				     IDENTIFIER_POINTER (yyvsp[0].ttype));

			      if (! undeclared_variable_notice)
				{
				  error ("(Each undeclared identifier is reported only once");
				  error ("for each function it appears in.)");
				  undeclared_variable_notice = 1;
				}
			    }
			  yyval.ttype = error_mark_node;
			  /* Prevent repeated error messages.  */
			  IDENTIFIER_GLOBAL_VALUE (yyvsp[0].ttype) = error_mark_node;
			  IDENTIFIER_ERROR_LOCUS (yyvsp[0].ttype) = current_function_decl;
			}
		    }
		  else if (! TREE_USED (yyval.ttype))
		    {
		      if (TREE_EXTERNAL (yyval.ttype))
			assemble_external (yyval.ttype);
		      TREE_USED (yyval.ttype) = 1;
		    }
		  if (TREE_CODE (yyval.ttype) == CONST_DECL)
		    yyval.ttype = DECL_INITIAL (yyval.ttype);
		;
    break;}
case 74:
#line 422 "c-parse.y"
{ yyval.ttype = combine_strings (yyvsp[0].ttype); ;
    break;}
case 75:
#line 424 "c-parse.y"
{ yyval.ttype = yyvsp[-1].ttype; ;
    break;}
case 76:
#line 426 "c-parse.y"
{ yyval.ttype = error_mark_node; ;
    break;}
case 77:
#line 428 "c-parse.y"
{ if (current_function_decl == 0)
		    {
		      error ("braced-group within expression allowed only inside a function");
		      YYERROR;
		    }
		  yyval.ttype = expand_start_stmt_expr (); ;
    break;}
case 78:
#line 435 "c-parse.y"
{ if (pedantic)
		    warning ("ANSI C forbids braced-groups within expressions");
		  yyval.ttype = expand_end_stmt_expr (yyvsp[-2].ttype); ;
    break;}
case 79:
#line 439 "c-parse.y"
{ yyval.ttype = build_function_call (yyvsp[-3].ttype, yyvsp[-1].ttype); ;
    break;}
case 80:
#line 441 "c-parse.y"
{ yyval.ttype = build_array_ref (yyvsp[-3].ttype, yyvsp[-1].ttype); ;
    break;}
case 81:
#line 443 "c-parse.y"
{ yyval.ttype = build_component_ref (yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 82:
#line 445 "c-parse.y"
{ yyval.ttype = build_component_ref (build_indirect_ref (yyvsp[-2].ttype, "->"), yyvsp[0].ttype); ;
    break;}
case 83:
#line 447 "c-parse.y"
{ yyval.ttype = build_unary_op (POSTINCREMENT_EXPR, yyvsp[-1].ttype, 0); ;
    break;}
case 84:
#line 449 "c-parse.y"
{ yyval.ttype = build_unary_op (POSTDECREMENT_EXPR, yyvsp[-1].ttype, 0); ;
    break;}
case 86:
#line 456 "c-parse.y"
{ yyval.ttype = chainon (yyvsp[-1].ttype, yyvsp[0].ttype); ;
    break;}
case 93:
#line 474 "c-parse.y"
{ current_declspecs = yyvsp[0].ttype;
		  yyval.itype = suspend_momentary (); ;
    break;}
case 94:
#line 480 "c-parse.y"
{ resume_momentary (yyvsp[-2].itype); ;
    break;}
case 95:
#line 482 "c-parse.y"
{ resume_momentary (yyvsp[-2].itype); ;
    break;}
case 96:
#line 484 "c-parse.y"
{ shadow_tag (yyvsp[-1].ttype); ;
    break;}
case 97:
#line 486 "c-parse.y"
{ warning ("empty declaration"); ;
    break;}
case 98:
#line 495 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, yyvsp[-1].ttype, yyvsp[0].ttype); ;
    break;}
case 99:
#line 497 "c-parse.y"
{ yyval.ttype = chainon (yyvsp[0].ttype, tree_cons (NULL_TREE, yyvsp[-1].ttype, yyvsp[-2].ttype)); ;
    break;}
case 100:
#line 501 "c-parse.y"
{ yyval.ttype = NULL_TREE; ;
    break;}
case 101:
#line 503 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ;
    break;}
case 102:
#line 505 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ;
    break;}
case 103:
#line 514 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, NULL_TREE); ;
    break;}
case 104:
#line 516 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, NULL_TREE); ;
    break;}
case 105:
#line 518 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ;
    break;}
case 106:
#line 520 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ;
    break;}
case 107:
#line 530 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, yyvsp[-1].ttype, yyvsp[0].ttype); ;
    break;}
case 108:
#line 532 "c-parse.y"
{ yyval.ttype = chainon (yyvsp[0].ttype, tree_cons (NULL_TREE, yyvsp[-1].ttype, yyvsp[-2].ttype)); ;
    break;}
case 109:
#line 536 "c-parse.y"
{ yyval.ttype = NULL_TREE; ;
    break;}
case 110:
#line 538 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ;
    break;}
case 114:
#line 549 "c-parse.y"
{ yyval.ttype = TREE_TYPE (yyvsp[-1].ttype);
		  if (pedantic)
		    warning ("ANSI C forbids `typeof'"); ;
    break;}
case 115:
#line 553 "c-parse.y"
{ yyval.ttype = groktypename (yyvsp[-1].ttype);
		  if (pedantic)
		    warning ("ANSI C forbids `typeof'"); ;
    break;}
case 123:
#line 577 "c-parse.y"
{ yyval.ttype = NULL_TREE; ;
    break;}
case 124:
#line 579 "c-parse.y"
{ if (TREE_CHAIN (yyvsp[-1].ttype)) yyvsp[-1].ttype = combine_strings (yyvsp[-1].ttype);
		  yyval.ttype = yyvsp[-1].ttype;
		  if (pedantic)
		    warning ("ANSI C forbids use of `asm' keyword");
		;
    break;}
case 125:
#line 588 "c-parse.y"
{ yyval.ttype = start_decl (yyvsp[-2].ttype, current_declspecs, 1); ;
    break;}
case 126:
#line 591 "c-parse.y"
{ finish_decl (yyvsp[-1].ttype, yyvsp[0].ttype, yyvsp[-3].ttype); ;
    break;}
case 127:
#line 593 "c-parse.y"
{ tree d = start_decl (yyvsp[-1].ttype, current_declspecs, 0);
		  finish_decl (d, NULL_TREE, yyvsp[0].ttype); ;
    break;}
case 128:
#line 599 "c-parse.y"
{ yyval.ttype = start_decl (yyvsp[-2].ttype, current_declspecs, 1); ;
    break;}
case 129:
#line 602 "c-parse.y"
{ finish_decl (yyvsp[-1].ttype, yyvsp[0].ttype, yyvsp[-3].ttype); ;
    break;}
case 130:
#line 604 "c-parse.y"
{ tree d = start_decl (yyvsp[-1].ttype, current_declspecs, 0);
		  finish_decl (d, NULL_TREE, yyvsp[0].ttype); ;
    break;}
case 132:
#line 611 "c-parse.y"
{ yyval.ttype = build_nt (CONSTRUCTOR, NULL_TREE, NULL_TREE);
		  if (pedantic)
		    warning ("ANSI C forbids empty initializer braces"); ;
    break;}
case 133:
#line 615 "c-parse.y"
{ yyval.ttype = build_nt (CONSTRUCTOR, NULL_TREE, nreverse (yyvsp[-1].ttype)); ;
    break;}
case 134:
#line 617 "c-parse.y"
{ yyval.ttype = build_nt (CONSTRUCTOR, NULL_TREE, nreverse (yyvsp[-2].ttype)); ;
    break;}
case 135:
#line 619 "c-parse.y"
{ yyval.ttype = NULL_TREE; ;
    break;}
case 136:
#line 626 "c-parse.y"
{ yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); ;
    break;}
case 137:
#line 628 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-2].ttype); ;
    break;}
case 140:
#line 643 "c-parse.y"
{ yyval.ttype = yyvsp[-1].ttype; ;
    break;}
case 141:
#line 645 "c-parse.y"
{ yyval.ttype = build_nt (CALL_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); ;
    break;}
case 142:
#line 650 "c-parse.y"
{ yyval.ttype = build_nt (ARRAY_REF, yyvsp[-3].ttype, yyvsp[-1].ttype); ;
    break;}
case 143:
#line 652 "c-parse.y"
{ yyval.ttype = build_nt (ARRAY_REF, yyvsp[-2].ttype, NULL_TREE); ;
    break;}
case 144:
#line 654 "c-parse.y"
{ yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ;
    break;}
case 146:
#line 665 "c-parse.y"
{ yyval.ttype = build_nt (CALL_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); ;
    break;}
case 147:
#line 670 "c-parse.y"
{ yyval.ttype = build_nt (ARRAY_REF, yyvsp[-3].ttype, yyvsp[-1].ttype); ;
    break;}
case 148:
#line 672 "c-parse.y"
{ yyval.ttype = build_nt (ARRAY_REF, yyvsp[-2].ttype, NULL_TREE); ;
    break;}
case 149:
#line 674 "c-parse.y"
{ yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ;
    break;}
case 151:
#line 683 "c-parse.y"
{ yyval.ttype = build_nt (CALL_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); ;
    break;}
case 152:
#line 688 "c-parse.y"
{ yyval.ttype = yyvsp[-1].ttype; ;
    break;}
case 153:
#line 690 "c-parse.y"
{ yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ;
    break;}
case 154:
#line 692 "c-parse.y"
{ yyval.ttype = build_nt (ARRAY_REF, yyvsp[-3].ttype, yyvsp[-1].ttype); ;
    break;}
case 155:
#line 694 "c-parse.y"
{ yyval.ttype = build_nt (ARRAY_REF, yyvsp[-2].ttype, NULL_TREE); ;
    break;}
case 157:
#line 700 "c-parse.y"
{ yyval.ttype = start_struct (RECORD_TYPE, yyvsp[-1].ttype);
		  /* Start scope of tag before parsing components.  */
		;
    break;}
case 158:
#line 704 "c-parse.y"
{ yyval.ttype = finish_struct (yyvsp[-2].ttype, yyvsp[-1].ttype);
		  /* Really define the structure.  */
		;
    break;}
case 159:
#line 708 "c-parse.y"
{ yyval.ttype = finish_struct (start_struct (RECORD_TYPE, NULL_TREE),
				      yyvsp[-1].ttype); ;
    break;}
case 160:
#line 711 "c-parse.y"
{ yyval.ttype = xref_tag (RECORD_TYPE, yyvsp[0].ttype); ;
    break;}
case 161:
#line 713 "c-parse.y"
{ yyval.ttype = start_struct (UNION_TYPE, yyvsp[-1].ttype); ;
    break;}
case 162:
#line 715 "c-parse.y"
{ yyval.ttype = finish_struct (yyvsp[-2].ttype, yyvsp[-1].ttype); ;
    break;}
case 163:
#line 717 "c-parse.y"
{ yyval.ttype = finish_struct (start_struct (UNION_TYPE, NULL_TREE),
				      yyvsp[-1].ttype); ;
    break;}
case 164:
#line 720 "c-parse.y"
{ yyval.ttype = xref_tag (UNION_TYPE, yyvsp[0].ttype); ;
    break;}
case 165:
#line 722 "c-parse.y"
{ yyvsp[0].itype = suspend_momentary ();
		  yyval.ttype = start_enum (yyvsp[-1].ttype); ;
    break;}
case 166:
#line 725 "c-parse.y"
{ yyval.ttype = finish_enum (yyvsp[-3].ttype, nreverse (yyvsp[-2].ttype));
		  resume_momentary (yyvsp[-4].itype); ;
    break;}
case 167:
#line 728 "c-parse.y"
{ yyvsp[0].itype = suspend_momentary ();
		  yyval.ttype = start_enum (NULL_TREE); ;
    break;}
case 168:
#line 731 "c-parse.y"
{ yyval.ttype = finish_enum (yyvsp[-3].ttype, nreverse (yyvsp[-2].ttype));
		  resume_momentary (yyvsp[-4].itype); ;
    break;}
case 169:
#line 734 "c-parse.y"
{ yyval.ttype = xref_tag (ENUMERAL_TYPE, yyvsp[0].ttype); ;
    break;}
case 173:
#line 745 "c-parse.y"
{ if (pedantic) warning ("comma at end of enumerator list"); ;
    break;}
case 174:
#line 749 "c-parse.y"
{ yyval.ttype = NULL_TREE; ;
    break;}
case 175:
#line 751 "c-parse.y"
{ yyval.ttype = chainon (yyvsp[-2].ttype, yyvsp[-1].ttype); ;
    break;}
case 176:
#line 753 "c-parse.y"
{ if (pedantic) 
		    warning ("extra semicolon in struct or union specified"); ;
    break;}
case 177:
#line 768 "c-parse.y"
{ yyval.ttype = yyvsp[0].ttype;
		  resume_momentary (yyvsp[-1].itype); ;
    break;}
case 178:
#line 771 "c-parse.y"
{ yyval.ttype = yyvsp[0].ttype;
		  resume_momentary (yyvsp[-1].itype); ;
    break;}
case 179:
#line 774 "c-parse.y"
{ yyval.ttype = NULL_TREE; ;
    break;}
case 180:
#line 779 "c-parse.y"
{ if (pedantic)
		    warning ("ANSI C forbids member declarations with no members");
		  yyval.ttype = NULL_TREE; ;
    break;}
case 182:
#line 784 "c-parse.y"
{ yyval.ttype = chainon (yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 183:
#line 789 "c-parse.y"
{ yyval.ttype = grokfield (input_filename, lineno, yyvsp[0].ttype, current_declspecs, NULL_TREE); ;
    break;}
case 184:
#line 791 "c-parse.y"
{ yyval.ttype = grokfield (input_filename, lineno, yyvsp[-2].ttype, current_declspecs, yyvsp[0].ttype); ;
    break;}
case 185:
#line 793 "c-parse.y"
{ yyval.ttype = grokfield (input_filename, lineno, NULL_TREE, current_declspecs, yyvsp[0].ttype); ;
    break;}
case 187:
#line 804 "c-parse.y"
{ yyval.ttype = chainon (yyvsp[0].ttype, yyvsp[-2].ttype); ;
    break;}
case 188:
#line 810 "c-parse.y"
{ yyval.ttype = build_enumerator (yyvsp[0].ttype, NULL_TREE); ;
    break;}
case 189:
#line 812 "c-parse.y"
{ yyval.ttype = build_enumerator (yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 190:
#line 817 "c-parse.y"
{ yyval.ttype = build_tree_list (yyvsp[-1].ttype, yyvsp[0].ttype); ;
    break;}
case 191:
#line 819 "c-parse.y"
{ yyval.ttype = build_tree_list (yyvsp[-1].ttype, yyvsp[0].ttype); ;
    break;}
case 192:
#line 824 "c-parse.y"
{ yyval.ttype = NULL_TREE; ;
    break;}
case 194:
#line 830 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, NULL_TREE); ;
    break;}
case 195:
#line 832 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ;
    break;}
case 196:
#line 837 "c-parse.y"
{ yyval.ttype = NULL_TREE; ;
    break;}
case 197:
#line 839 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-1].ttype); ;
    break;}
case 198:
#line 844 "c-parse.y"
{ yyval.ttype = yyvsp[-1].ttype; ;
    break;}
case 199:
#line 847 "c-parse.y"
{ yyval.ttype = make_pointer_declarator (yyvsp[-1].ttype, yyvsp[0].ttype); ;
    break;}
case 200:
#line 849 "c-parse.y"
{ yyval.ttype = make_pointer_declarator (yyvsp[0].ttype, NULL_TREE); ;
    break;}
case 201:
#line 851 "c-parse.y"
{ yyval.ttype = build_nt (CALL_EXPR, yyvsp[-2].ttype, yyvsp[0].ttype, NULL_TREE); ;
    break;}
case 202:
#line 853 "c-parse.y"
{ yyval.ttype = build_nt (ARRAY_REF, yyvsp[-3].ttype, yyvsp[-1].ttype); ;
    break;}
case 203:
#line 855 "c-parse.y"
{ yyval.ttype = build_nt (ARRAY_REF, yyvsp[-2].ttype, NULL_TREE); ;
    break;}
case 204:
#line 857 "c-parse.y"
{ yyval.ttype = build_nt (CALL_EXPR, NULL_TREE, yyvsp[0].ttype, NULL_TREE); ;
    break;}
case 205:
#line 859 "c-parse.y"
{ yyval.ttype = build_nt (ARRAY_REF, NULL_TREE, yyvsp[-1].ttype); ;
    break;}
case 206:
#line 861 "c-parse.y"
{ yyval.ttype = build_nt (ARRAY_REF, NULL_TREE, NULL_TREE); ;
    break;}
case 213:
#line 883 "c-parse.y"
{ pushlevel (0);
		  clear_last_expr ();
		  push_momentary ();
		  expand_start_bindings (0); ;
    break;}
case 217:
#line 898 "c-parse.y"
{ expand_end_bindings (getdecls (), 1, 0);
		  poplevel (1, 1, 0);
		  pop_momentary (); ;
    break;}
case 218:
#line 902 "c-parse.y"
{ expand_end_bindings (getdecls (), 0, 0);
		  poplevel (0, 0, 0);
		  pop_momentary (); ;
    break;}
case 219:
#line 906 "c-parse.y"
{ expand_end_bindings (getdecls (), 0, 0);
		  poplevel (0, 0, 0);
		  pop_momentary (); ;
    break;}
case 220:
#line 913 "c-parse.y"
{ emit_line_note (input_filename, lineno);
		  expand_start_cond (truthvalue_conversion (yyvsp[-1].ttype), 0); ;
    break;}
case 223:
#line 921 "c-parse.y"
{ emit_line_note (input_filename, lineno);
		  expand_expr_stmt (yyvsp[-1].ttype);
		  clear_momentary (); ;
    break;}
case 224:
#line 925 "c-parse.y"
{ expand_start_else (); ;
    break;}
case 225:
#line 927 "c-parse.y"
{ expand_end_else (); ;
    break;}
case 226:
#line 929 "c-parse.y"
{ expand_end_cond (); ;
    break;}
case 227:
#line 931 "c-parse.y"
{ emit_line_note (input_filename, lineno);
		  expand_start_loop (1); ;
    break;}
case 228:
#line 934 "c-parse.y"
{ emit_line_note (input_filename, lineno);
		  expand_exit_loop_if_false (truthvalue_conversion (yyvsp[-1].ttype)); ;
    break;}
case 229:
#line 937 "c-parse.y"
{ expand_end_loop (); ;
    break;}
case 230:
#line 939 "c-parse.y"
{ emit_line_note (input_filename, lineno);
		  expand_start_loop_continue_elsewhere (1); ;
    break;}
case 231:
#line 942 "c-parse.y"
{ expand_loop_continue_here (); ;
    break;}
case 232:
#line 944 "c-parse.y"
{ emit_line_note (input_filename, lineno);
		  expand_exit_loop_if_false (truthvalue_conversion (yyvsp[-2].ttype));
		  expand_end_loop ();
		  clear_momentary (); ;
    break;}
case 233:
#line 950 "c-parse.y"
{ emit_line_note (input_filename, lineno);
		  if (yyvsp[-1].ttype) expand_expr_stmt (yyvsp[-1].ttype);
		  expand_start_loop_continue_elsewhere (1); ;
    break;}
case 234:
#line 954 "c-parse.y"
{ emit_line_note (input_filename, lineno);
		  if (yyvsp[-1].ttype)
		    expand_exit_loop_if_false (truthvalue_conversion (yyvsp[-1].ttype)); ;
    break;}
case 235:
#line 960 "c-parse.y"
{ push_momentary ();
		  yyvsp[0].itype = lineno; ;
    break;}
case 236:
#line 963 "c-parse.y"
{ emit_line_note (input_filename, yyvsp[-2].itype);
		  expand_loop_continue_here ();
		  if (yyvsp[-3].ttype)
		    expand_expr_stmt (yyvsp[-3].ttype);
		  pop_momentary ();
		  expand_end_loop (); ;
    break;}
case 237:
#line 970 "c-parse.y"
{ emit_line_note (input_filename, lineno);
		  c_expand_start_case (yyvsp[-1].ttype);
		  /* Don't let the tree nodes for $3 be discarded by
		     clear_momentary during the parsing of the next stmt.  */
		  push_momentary (); ;
    break;}
case 238:
#line 976 "c-parse.y"
{ expand_end_case (yyvsp[-3].ttype);
		  pop_momentary (); ;
    break;}
case 239:
#line 979 "c-parse.y"
{ register tree value = fold (yyvsp[-1].ttype);
		  register tree label
		    = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);

		  /* build_c_cast puts on a NOP_EXPR to make a non-lvalue.
		     Strip such NOP_EXPRs.  */
		  if (TREE_CODE (value) == NOP_EXPR
		      && TREE_TYPE (value) == TREE_TYPE (TREE_OPERAND (value, 0)))
		    value = TREE_OPERAND (value, 0);

		  if (TREE_CODE (value) != INTEGER_CST
		      && value != error_mark_node)
		    {
		      error ("case label does not reduce to an integer constant");
		      value = error_mark_node;
		    }
		  else
		    /* Promote char or short to int.  */
		    value = default_conversion (value);
		  if (value != error_mark_node)
		    {
		      int success = pushcase (value, label);
		      if (success == 1)
			error ("case label not within a switch statement");
		      else if (success == 2)
			error ("duplicate case value");
		      else if (success == 3)
			warning ("case value out of range");
		    }
		;
    break;}
case 241:
#line 1011 "c-parse.y"
{
		  register tree label
		    = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
		  int success = pushcase (NULL_TREE, label);
		  if (success == 1)
		    error ("default label not within a switch statement");
		  else if (success == 2)
		    error ("multiple default labels in one switch");
		;
    break;}
case 243:
#line 1022 "c-parse.y"
{ emit_line_note (input_filename, lineno);
		  if ( ! expand_exit_something ())
		    error ("break statement not within loop or switch"); ;
    break;}
case 244:
#line 1026 "c-parse.y"
{ emit_line_note (input_filename, lineno);
		  if (! expand_continue_loop ())
		    error ("continue statement not within a loop"); ;
    break;}
case 245:
#line 1030 "c-parse.y"
{ emit_line_note (input_filename, lineno);
		  c_expand_return (NULL_TREE); ;
    break;}
case 246:
#line 1033 "c-parse.y"
{ emit_line_note (input_filename, lineno);
		  c_expand_return (yyvsp[-1].ttype); ;
    break;}
case 247:
#line 1036 "c-parse.y"
{ if (TREE_CHAIN (yyvsp[-2].ttype)) yyvsp[-2].ttype = combine_strings (yyvsp[-2].ttype);
		  expand_asm (yyvsp[-2].ttype); ;
    break;}
case 248:
#line 1040 "c-parse.y"
{ if (TREE_CHAIN (yyvsp[-4].ttype)) yyvsp[-4].ttype = combine_strings (yyvsp[-4].ttype);
		  c_expand_asm_operands (yyvsp[-4].ttype, yyvsp[-2].ttype, NULL_TREE, NULL_TREE,
					 yyvsp[-6].ttype == ridpointers[(int)RID_VOLATILE],
					 input_filename, lineno); ;
    break;}
case 249:
#line 1046 "c-parse.y"
{ if (TREE_CHAIN (yyvsp[-6].ttype)) yyvsp[-6].ttype = combine_strings (yyvsp[-6].ttype);
		  c_expand_asm_operands (yyvsp[-6].ttype, yyvsp[-4].ttype, yyvsp[-2].ttype, NULL_TREE,
					 yyvsp[-8].ttype == ridpointers[(int)RID_VOLATILE],
					 input_filename, lineno); ;
    break;}
case 250:
#line 1053 "c-parse.y"
{ if (TREE_CHAIN (yyvsp[-8].ttype)) yyvsp[-8].ttype = combine_strings (yyvsp[-8].ttype);
		  c_expand_asm_operands (yyvsp[-8].ttype, yyvsp[-6].ttype, yyvsp[-4].ttype, yyvsp[-2].ttype,
					 yyvsp[-10].ttype == ridpointers[(int)RID_VOLATILE],
					 input_filename, lineno); ;
    break;}
case 251:
#line 1058 "c-parse.y"
{ tree decl;
		  emit_line_note (input_filename, lineno);
		  decl = lookup_label (yyvsp[-1].ttype);
		  TREE_USED (decl) = 1;
		  expand_goto (decl); ;
    break;}
case 252:
#line 1064 "c-parse.y"
{ tree label = define_label (input_filename, lineno, yyvsp[-1].ttype);
		  if (label)
		    expand_label (label); ;
    break;}
case 255:
#line 1075 "c-parse.y"
{ if (pedantic)
		    warning ("ANSI C forbids use of `asm' keyword");
		  emit_line_note (input_filename, lineno); ;
    break;}
case 256:
#line 1079 "c-parse.y"
{ if (pedantic)
		    warning ("ANSI C forbids use of `asm' keyword");
		  emit_line_note (input_filename, lineno); ;
    break;}
case 257:
#line 1086 "c-parse.y"
{ yyval.ttype = NULL_TREE; ;
    break;}
case 259:
#line 1093 "c-parse.y"
{ yyval.ttype = NULL_TREE; ;
    break;}
case 262:
#line 1100 "c-parse.y"
{ yyval.ttype = chainon (yyvsp[-2].ttype, yyvsp[0].ttype); ;
    break;}
case 263:
#line 1105 "c-parse.y"
{ yyval.ttype = build_tree_list (yyvsp[-3].ttype, yyvsp[-1].ttype); ;
    break;}
case 264:
#line 1110 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, NULL_TREE); ;
    break;}
case 265:
#line 1112 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, yyvsp[0].ttype, yyvsp[-2].ttype); ;
    break;}
case 266:
#line 1118 "c-parse.y"
{ pushlevel (0); ;
    break;}
case 267:
#line 1120 "c-parse.y"
{ yyval.ttype = yyvsp[0].ttype;
		  parmlist_tags_warning ();
		  poplevel (0, 0, 0); ;
    break;}
case 268:
#line 1128 "c-parse.y"
{ pushlevel (0); ;
    break;}
case 269:
#line 1130 "c-parse.y"
{ yyval.ttype = yyvsp[0].ttype;
		  parmlist_tags_warning ();
		  poplevel (0, 0, 0); ;
    break;}
case 271:
#line 1138 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, NULL_TREE, yyvsp[-1].ttype); ;
    break;}
case 272:
#line 1140 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE); ;
    break;}
case 274:
#line 1146 "c-parse.y"
{ yyval.ttype = tree_cons (NULL_TREE, NULL_TREE, NULL_TREE); ;
    break;}
case 275:
#line 1152 "c-parse.y"
{ yyval.ttype = get_parm_info (0); ;
    break;}
case 276:
#line 1154 "c-parse.y"
{ yyval.ttype = get_parm_info (1); ;
    break;}
case 277:
#line 1156 "c-parse.y"
{ yyval.ttype = get_parm_info (0); ;
    break;}
case 278:
#line 1161 "c-parse.y"
{ push_parm_decl (yyvsp[0].ttype); ;
    break;}
case 279:
#line 1163 "c-parse.y"
{ push_parm_decl (yyvsp[0].ttype); ;
    break;}
case 280:
#line 1170 "c-parse.y"
{ yyval.ttype = build_tree_list (yyvsp[-1].ttype, yyvsp[0].ttype)	; ;
    break;}
case 281:
#line 1172 "c-parse.y"
{ yyval.ttype = build_tree_list (yyvsp[-1].ttype, yyvsp[0].ttype)	; ;
    break;}
case 282:
#line 1174 "c-parse.y"
{ yyval.ttype = build_tree_list (yyvsp[-1].ttype, yyvsp[0].ttype); ;
    break;}
case 283:
#line 1176 "c-parse.y"
{ yyval.ttype = build_tree_list (yyvsp[-1].ttype, yyvsp[0].ttype)	; ;
    break;}
case 284:
#line 1178 "c-parse.y"
{ yyval.ttype = build_tree_list (yyvsp[-1].ttype, yyvsp[0].ttype); ;
    break;}
case 285:
#line 1184 "c-parse.y"
{ yyval.ttype = build_tree_list (NULL_TREE, yyvsp[0].ttype); ;
    break;}
case 286:
#line 1186 "c-parse.y"
{ yyval.ttype = chainon (yyvsp[-2].ttype, build_tree_list (NULL_TREE, yyvsp[0].ttype)); ;
    break;}
}
   /* the action file gets copied in in place of this dollarsign */
#line 412 "bison.simple"

  yyvsp -= yylen;
  yyssp -= yylen;
#ifdef YYLSP_NEEDED
  yylsp -= yylen;
#endif

#if YYDEBUG != 0
  if (yydebug)
    {
      short *ssp1 = yyss - 1;
      fprintf (stderr, "state stack now");
      while (ssp1 != yyssp)
	fprintf (stderr, " %d", *++ssp1);
      fprintf (stderr, "\n");
    }
#endif

  *++yyvsp = yyval;

#ifdef YYLSP_NEEDED
  yylsp++;
  if (yylen == 0)
    {
      yylsp->first_line = yylloc.first_line;
      yylsp->first_column = yylloc.first_column;
      yylsp->last_line = (yylsp-1)->last_line;
      yylsp->last_column = (yylsp-1)->last_column;
      yylsp->text = 0;
    }
  else
    {
      yylsp->last_line = (yylsp+yylen-1)->last_line;
      yylsp->last_column = (yylsp+yylen-1)->last_column;
    }
#endif

  /* Now "shift" the result of the reduction.
     Determine what state that goes to,
     based on the state we popped back to
     and the rule number reduced by.  */

  yyn = yyr1[yyn];

  yystate = yypgoto[yyn - YYNTBASE] + *yyssp;
  if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)
    yystate = yytable[yystate];
  else
    yystate = yydefgoto[yyn - YYNTBASE];

  goto yynewstate;

yyerrlab:   /* here on detecting error */

  if (! yyerrstatus)
    /* If not already recovering from an error, report this error.  */
    {
      ++yynerrs;
      yyerror("parse error");
    }

  if (yyerrstatus == 3)
    {
      /* if just tried and failed to reuse lookahead token after an error, discard it.  */

      /* return failure if at end of input */
      if (yychar == YYEOF)
	YYABORT;

#if YYDEBUG != 0
      if (yydebug)
	fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]);
#endif

      yychar = YYEMPTY;
    }

  /* Else will try to reuse lookahead token
     after shifting the error token.  */

  yyerrstatus = 3;		/* Each real token shifted decrements this */

  goto yyerrhandle;

yyerrdefault:  /* current state does not do anything special for the error token. */

#if 0
  /* This is wrong; only states that explicitly want error tokens
     should shift them.  */
  yyn = yydefact[yystate];  /* If its default is to accept any token, ok.  Otherwise pop it.*/
  if (yyn) goto yydefault;
#endif

yyerrpop:   /* pop the current state because it cannot handle the error token */

  if (yyssp == yyss) YYABORT;
  yyvsp--;
  yystate = *--yyssp;
#ifdef YYLSP_NEEDED
  yylsp--;
#endif

#if YYDEBUG != 0
  if (yydebug)
    {
      short *ssp1 = yyss - 1;
      fprintf (stderr, "Error: state stack now");
      while (ssp1 != yyssp)
	fprintf (stderr, " %d", *++ssp1);
      fprintf (stderr, "\n");
    }
#endif

yyerrhandle:

  yyn = yypact[yystate];
  if (yyn == YYFLAG)
    goto yyerrdefault;

  yyn += YYTERROR;
  if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR)
    goto yyerrdefault;

  yyn = yytable[yyn];
  if (yyn < 0)
    {
      if (yyn == YYFLAG)
	goto yyerrpop;
      yyn = -yyn;
      goto yyreduce;
    }
  else if (yyn == 0)
    goto yyerrpop;

  if (yyn == YYFINAL)
    YYACCEPT;

#if YYDEBUG != 0
  if (yydebug)
    fprintf(stderr, "Shifting error token, ");
#endif

  *++yyvsp = yylval;
#ifdef YYLSP_NEEDED
  *++yylsp = yylloc;
#endif

  yystate = yyn;
  goto yynewstate;
}
#line 1188 "c-parse.y"


/* Return something to represent absolute declarators containing a *.
   TARGET is the absolute declarator that the * contains.
   TYPE_QUALS is a list of modifiers such as const or volatile
   to apply to the pointer type, represented as identifiers.

   We return an INDIRECT_REF whose "contents" are TARGET
   and whose type is the modifier list.  */
   
static tree
make_pointer_declarator (type_quals, target)
     tree type_quals, target;
{
  return build (INDIRECT_REF, type_quals, target);
}

/* Given a chain of STRING_CST nodes,
   concatenate them into one STRING_CST
   and give it a suitable array-of-chars data type.  */

static tree
combine_strings (strings)
     tree strings;
{
  register tree value, t;
  register int length = 1;
  int wide_length = 0;
  int wide_flag = 0;

  if (TREE_CHAIN (strings))
    {
      /* More than one in the chain, so concatenate.  */
      register char *p, *q;

      /* Don't include the \0 at the end of each substring,
	 except for the last one.
	 Count wide strings and ordinary strings separately.  */
      for (t = strings; t; t = TREE_CHAIN (t))
	{
	  if (TREE_TYPE (t) == int_array_type_node)
	    {
	      wide_length += (TREE_STRING_LENGTH (t) - 1);
	      wide_flag = 1;
	    }
	  else
	    length += (TREE_STRING_LENGTH (t) - 1);
	}

      /* If anything is wide, the non-wides will be converted,
	 which makes them take more space.  */
      if (wide_flag)
	length = length * UNITS_PER_WORD + wide_length;

      p = (char *) oballoc (length);

      /* Copy the individual strings into the new combined string.
	 If the combined string is wide, convert the chars to ints
	 for any individual strings that are not wide.  */

      q = p;
      for (t = strings; t; t = TREE_CHAIN (t))
	{
	  int len = TREE_STRING_LENGTH (t) - 1;
	  if ((TREE_TYPE (t) == int_array_type_node) == wide_flag)
	    {
	      bcopy (TREE_STRING_POINTER (t), q, len);
	      q += len;
	    }
	  else
	    {
	      int i;
	      for (i = 0; i < len; i++)
		((int *) q)[i] = TREE_STRING_POINTER (t)[i];
	      q += len * UNITS_PER_WORD;
	    }
	}
      *q = 0;

      value = make_node (STRING_CST);
      TREE_STRING_POINTER (value) = p;
      TREE_STRING_LENGTH (value) = length;
      TREE_LITERAL (value) = 1;
    }
  else
    {
      value = strings;
      length = TREE_STRING_LENGTH (value);
      if (TREE_TYPE (value) == int_array_type_node)
	wide_flag = 1;
    }

  /* Create the array type for the string constant.
     -Wwrite-strings says make the string constant an array of const char
     so that copying it to a non-const pointer will get a warning.  */
  if (warn_write_strings)
    {
      tree elements
	= build_type_variant (wide_flag ? integer_type_node : char_type_node,
			      1, 0);
      TREE_TYPE (value)
	= build_array_type (elements,
			    build_index_type (build_int_2 (length - 1, 0)));
    }
  else
    TREE_TYPE (value)
      = build_array_type (wide_flag ? integer_type_node : char_type_node,
			  build_index_type (build_int_2 (length - 1, 0)));
  TREE_LITERAL (value) = 1;
  TREE_STATIC (value) = 1;
  return value;
}

int lineno;			/* current line number in file being read */

FILE *finput;			/* input file.
				   Normally a pipe from the preprocessor.  */

/* lexical analyzer */

static int maxtoken;		/* Current nominal length of token buffer.  */
static char *token_buffer;	/* Pointer to token buffer.
				   Actual allocated length is maxtoken + 2.  */
static int max_wide;		/* Current nominal length of wide_buffer.  */
static int *wide_buffer;	/* Pointer to wide-string buffer.
				   Actual allocated length is max_wide + 1.  */

/* Nonzero if end-of-file has been seen on input.  */
static int end_of_file;

/* Data type that represents the GNU C reserved words. */
struct resword { char *name; short token; enum rid rid; };

#define MIN_WORD_LENGTH     2      /* minimum size for C keyword */
#define MAX_WORD_LENGTH     9      /* maximum size for C keyword */
#define MIN_HASH_VALUE      4      /* range of the hash keys values  */
#define MAX_HASH_VALUE      52     /* for the perfect hash generator */
#define NORID RID_UNUSED

/* This function performs the minimum-perfect hash mapping from input
   string to reswords table index.  It only looks at the first and 
   last characters in the string, thus assuring the O(1) lookup time 
   (this keeps our constant down to an insignificant amount!).  Compiling
   the following 2 functions as inline removes all overhead of the
   function calls. */

#ifdef __GNUC__
inline 
#endif
static int 
hash (str, len)
     register char *str;
     register int len;
{
/* This table is used to build the hash table index that recognizes
   reserved words in 0(1) steps.  It is larger than strictly necessary, 
   but I'm trading off the space for the time-saving luxury of avoiding 
   subtraction of an offset.  All those ``52's'' (actually just a
   short-hand for MAX_HASH_VALUE #defined above) are used to speed up 
   the search when the string found on the input stream doesn't have a 
   first or last character that is part of the set of alphabetic 
   characters that comprise the first or last characters in C 
   reserved words. */

  static int hash_table[] = 
    {
      52,  52,  52,  52,  52,  52,  52,  52,  52,  52,
      52,  52,  52,  52,  52,  52,  52,  52,  52,  52,
      52,  52,  52,  52,  52,  52,  52,  52,  52,  52,
      52,  52,  52,  52,  52,  52,  52,  52,  52,  52,
      52,  52,  52,  52,  52,  52,  52,  52,  52,  52,
      52,  52,  52,  52,  52,  52,  52,  52,  52,  52,
      52,  52,  52,  52,  52,  52,  52,  52,  52,  52,
      52,  52,  52,  52,  52,  52,  52,  52,  52,  52,
      52,  52,  52,  52,  52,  52,  52,  52,  52,  52,
      52,  52,  52,  52,  52,   7,  52,  12,   0,  18,
       5,   0,  13,   2,   2,  29,  52,   0,   7,  37,
      25,   0,  52,  52,  17,  19,   0,  21,   1,   3,
      52,  52,  52,  52,  52,  52,  52,  52,
    };

  /* The hash function is very simple: add the length of STR
     to the hash_table value of its first and last character. 
     Putting LEN near LEN - 1 generates slightly better 
     code... */

  return len + hash_table[str[len - 1]] + hash_table[str[0]];
}

/* This routine attempts to match the string found in the reswords table
   with the one from the input stream.  If all the relevant details 
   match then an actual strcmp comparison is performed and the address of
   correct struct resword entry is returned.  Otherwise, a NULL 
   pointer is returned. */

#ifdef __GNUC__
inline 
#endif
struct resword *
is_reserved_word (str, len)
     register char *str;
     register int len;
{
  /* This is the hash table of keywords.
     The order of keywords has been chosen for perfect hashing.
     Therefore, this table cannot be updated by hand.
     Use the program ``gperf,'' available with the latest libg++ 
     distribution, to generate an updated table.  The command-line
     arguments to build this table were: gperf -g -o -j1 -t gnuc.input  */

  static struct resword reswords[] = 
    {
      { "",},{ "",},{ "",},{ "",},
      { "else", ELSE, NORID },
      { "break", BREAK, NORID },
      { "goto", GOTO, NORID },
      { "do", DO, NORID },
      { "while", WHILE, NORID },
      { "volatile", TYPE_QUAL, RID_VOLATILE },
      { "void", TYPESPEC, RID_VOID },
      { "double", TYPESPEC, RID_DOUBLE },
      { "default", DEFAULT, NORID },
      { "long", TYPESPEC, RID_LONG },
      { "__const", TYPE_QUAL, RID_CONST },
      { "__inline", SCSPEC, RID_INLINE },
      { "auto", SCSPEC, RID_AUTO },
      { "__volatile", TYPE_QUAL, RID_VOLATILE },
      { "float", TYPESPEC, RID_FLOAT },
      { "typeof", TYPEOF, NORID },
      { "typedef", SCSPEC, RID_TYPEDEF },
      { "",},
      { "case", CASE, NORID },
      { "const", TYPE_QUAL, RID_CONST },
      { "short", TYPESPEC, RID_SHORT },
      { "struct", STRUCT, NORID },
      { "continue", CONTINUE, NORID },
      { "switch", SWITCH, NORID },
      { "__typeof", TYPEOF, NORID },
      { "__alignof", ALIGNOF, NORID },
      { "signed", TYPESPEC, RID_SIGNED },
      { "extern", SCSPEC, RID_EXTERN },
      { "int", TYPESPEC, RID_INT },
      { "for", FOR, NORID },
      { "unsigned", TYPESPEC, RID_UNSIGNED },
      { "inline", SCSPEC, RID_INLINE },
      { "",},{ "",},
      { "sizeof", SIZEOF, NORID },
      { "char", TYPESPEC, RID_CHAR },
      { "",},
      { "enum", ENUM, NORID },
      { "register", SCSPEC, RID_REGISTER },
      { "static", SCSPEC, RID_STATIC },
      { "if", IF, NORID },
      { "",},{ "",},{ "",},
      { "return", RETURN, NORID },
      { "__asm", ASM, NORID },
      { "",},
      { "union", UNION, NORID },
      { "asm", ASM, NORID },
    };

  if (len <= MAX_WORD_LENGTH && len >= MIN_WORD_LENGTH) 
    {
      register int key = hash (str, len);

      if (key <= MAX_HASH_VALUE) 
        {
          register char *s = reswords[key].name;

          if (*s == *str && !strcmp (str + 1, s + 1)) 
            return &reswords[key];
        }
    }
  return 0;
}

/* The elements of `ridpointers' are identifier nodes
   for the reserved type names and storage classes.
   It is indexed by a RID_... value.  */

tree ridpointers[(int) RID_MAX];

int check_newline ();

void
init_lex ()
{
  /* Start it at 0, because check_newline is called at the very beginning
     and will increment it to 1.  */
  lineno = 0;

  maxtoken = 40;
  token_buffer = (char *) xmalloc (maxtoken + 2);
  max_wide = 40;
  wide_buffer = (int *) xmalloc (max_wide + 1);

  ridpointers[(int) RID_INT] = get_identifier ("int");
  ridpointers[(int) RID_CHAR] = get_identifier ("char");
  ridpointers[(int) RID_VOID] = get_identifier ("void");
  ridpointers[(int) RID_FLOAT] = get_identifier ("float");
  ridpointers[(int) RID_DOUBLE] = get_identifier ("double");
  ridpointers[(int) RID_SHORT] = get_identifier ("short");
  ridpointers[(int) RID_LONG] = get_identifier ("long");
  ridpointers[(int) RID_UNSIGNED] = get_identifier ("unsigned");
  ridpointers[(int) RID_SIGNED] = get_identifier ("signed");
  ridpointers[(int) RID_INLINE] = get_identifier ("inline");
  ridpointers[(int) RID_CONST] = get_identifier ("const");
  ridpointers[(int) RID_VOLATILE] = get_identifier ("volatile");
  ridpointers[(int) RID_AUTO] = get_identifier ("auto");
  ridpointers[(int) RID_STATIC] = get_identifier ("static");
  ridpointers[(int) RID_EXTERN] = get_identifier ("extern");
  ridpointers[(int) RID_TYPEDEF] = get_identifier ("typedef");
  ridpointers[(int) RID_REGISTER] = get_identifier ("register");
}

static void
reinit_parse_for_function ()
{
}

/* If C is not whitespace, return C.
   Otherwise skip whitespace and return first nonwhite char read.  */

static int
skip_white_space (c)
     register int c;
{
#if 0
  register int inside;
#endif

  for (;;)
    {
      switch (c)
	{
	  /* Don't recognize comments in cc1: all comments are removed by cpp,
	     and cpp output can include / and * consecutively as operators.  */
#if 0
	case '/':
	  c = getc (finput);
	  if (c != '*')
	    {
	      ungetc (c, finput);
	      return '/';
	    }

	  c = getc (finput);

	  inside = 1;
	  while (inside)
	    {
	      if (c == '*')
		{
		  while (c == '*')
		    c = getc (finput);

		  if (c == '/')
		    {
		      inside = 0;
		      c = getc (finput);
		    }
		}
	      else if (c == '\n')
		{
		  lineno++;
		  c = getc (finput);
		}
	      else if (c == EOF)
		{
		  error ("unterminated comment");
		  break;
		}
	      else
		c = getc (finput);
	    }

	  break;
#endif

	case '\n':
	  c = check_newline ();
	  break;

	case ' ':
	case '\t':
	case '\f':
	case '\r':
	case '\b':
	  c = getc (finput);
	  break;

	case '\\':
	  c = getc (finput);
	  if (c == '\n')
	    lineno++;
	  else
	    error ("stray '\\' in program");
	  c = getc (finput);
	  break;

	default:
	  return (c);
	}
    }
}



/* Make the token buffer longer, preserving the data in it.
   P should point to just beyond the last valid character in the old buffer.
   The value we return is a pointer to the new buffer
   at a place corresponding to P.  */

static char *
extend_token_buffer (p)
     char *p;
{
  int offset = p - token_buffer;

  maxtoken = maxtoken * 2 + 10;
  token_buffer = (char *) xrealloc (token_buffer, maxtoken + 2);

  return token_buffer + offset;
}

/* At the beginning of a line, increment the line number
   and process any #-directive on this line.
   If the line is a #-directive, read the entire line and return a newline.
   Otherwise, return the line's first non-whitespace character.  */

int
check_newline ()
{
  register int c;
  register int token;

  lineno++;

  /* Read first nonwhite char on the line.  */

  c = getc (finput);
  while (c == ' ' || c == '\t')
    c = getc (finput);

  if (c != '#')
    {
      /* If not #, return it so caller will use it.  */
      return c;
    }

  /* Read first nonwhite char after the `#'.  */

  c = getc (finput);
  while (c == ' ' || c == '\t')
    c = getc (finput);

  /* If a letter follows, then if the word here is `line', skip
     it and ignore it; otherwise, ignore the line, with an error
     if the word isn't `pragma'.  */

  if ((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z'))
    {
      if (c == 'p')
	{
	  if (getc (finput) == 'r'
	      && getc (finput) == 'a'
	      && getc (finput) == 'g'
	      && getc (finput) == 'm'
	      && getc (finput) == 'a'
	      && ((c = getc (finput)) == ' ' || c == '\t' || c == '\n'))
	    goto skipline;
	}

      else if (c == 'l')
	{
	  if (getc (finput) == 'i'
	      && getc (finput) == 'n'
	      && getc (finput) == 'e'
	      && ((c = getc (finput)) == ' ' || c == '\t'))
	    goto linenum;
	}
      else if (c == 'i')
	{
	  if (getc (finput) == 'd'
	      && getc (finput) == 'e'
	      && getc (finput) == 'n'
	      && getc (finput) == 't'
	      && ((c = getc (finput)) == ' ' || c == '\t'))
	    {
	      extern FILE *asm_out_file;

	      if (pedantic)
		error ("ANSI C does not allow #ident");

	      /* Here we have just seen `#ident '.
		 A string constant should follow.  */

	      while (c == ' ' || c == '\t')
		c = getc (finput);

	      /* If no argument, ignore the line.  */
	      if (c == '\n')
		return c;

	      ungetc (c, finput);
	      token = yylex ();
	      if (token != STRING
		  || TREE_CODE (yylval.ttype) != STRING_CST)
		{
		  error ("invalid #ident");
		  goto skipline;
		}

#ifdef ASM_OUTPUT_IDENT
	      ASM_OUTPUT_IDENT (asm_out_file, TREE_STRING_POINTER (yylval.ttype));
#endif

	      /* Skip the rest of this line.  */
	      goto skipline;
	    }
	}

      error ("undefined or invalid # directive");
      goto skipline;
    }

linenum:
  /* Here we have either `#line' or `# <nonletter>'.
     In either case, it should be a line number; a digit should follow.  */

  while (c == ' ' || c == '\t')
    c = getc (finput);

  /* If the # is the only nonwhite char on the line,
     just ignore it.  Check the new newline.  */
  if (c == '\n')
    return c;

  /* Something follows the #; read a token.  */

  ungetc (c, finput);
  token = yylex ();

  if (token == CONSTANT
      && TREE_CODE (yylval.ttype) == INTEGER_CST)
    {
      /* subtract one, because it is the following line that
	 gets the specified number */

      int l = TREE_INT_CST_LOW (yylval.ttype) - 1;

      /* Is this the last nonwhite stuff on the line?  */
      c = getc (finput);
      while (c == ' ' || c == '\t')
	c = getc (finput);
      if (c == '\n')
	{
	  /* No more: store the line number and check following line.  */
	  lineno = l;
	  return c;
	}
      ungetc (c, finput);

      /* More follows: it must be a string constant (filename).  */

      token = yylex ();
      if (token != STRING || TREE_CODE (yylval.ttype) != STRING_CST)
	{
	  error ("invalid #line");
	  goto skipline;
	}

      input_filename
	= (char *) permalloc (TREE_STRING_LENGTH (yylval.ttype) + 1);
      strcpy (input_filename, TREE_STRING_POINTER (yylval.ttype));
      lineno = l;

      if (main_input_filename == 0)
	main_input_filename = input_filename;
    }
  else
    error ("invalid #line");

  /* skip the rest of this line.  */
 skipline:
  if (c == '\n')
    return c;
  while ((c = getc (finput)) != EOF && c != '\n');
  return c;
}

#define isalnum(char) ((char >= 'a' && char <= 'z') || (char >= 'A' && char <= 'Z') || (char >= '0' && char <= '9'))
#define isdigit(char) (char >= '0' && char <= '9')
#define ENDFILE -1  /* token that represents end-of-file */


static int
readescape ()
{
  register int c = getc (finput);
  register int count, code;
  int firstdig;

  switch (c)
    {
    case 'x':
      code = 0;
      count = 0;
      while (1)
	{
	  c = getc (finput);
	  if (!(c >= 'a' && c <= 'f')
	      && !(c >= 'A' && c <= 'F')
	      && !(c >= '0' && c <= '9'))
	    {
	      ungetc (c, finput);
	      break;
	    }
	  code *= 16;
	  if (c >= 'a' && c <= 'f')
	    code += c - 'a' + 10;
	  if (c >= 'A' && c <= 'F')
	    code += c - 'A' + 10;
	  if (c >= '0' && c <= '9')
	    code += c - '0';
	  if (count == 0)
	    firstdig = code;
	  count++;
	}
      if (count == 0)
	error ("\\x used with no following hex digits");
      if ((count - 1) * 4 >= TYPE_PRECISION (integer_type_node)
	  || ((1 << (TYPE_PRECISION (integer_type_node) - (count - 1) * 4))
	      <= firstdig))
	warning ("hex escape out of range");
      return code;

    case '0':  case '1':  case '2':  case '3':  case '4':
    case '5':  case '6':  case '7':
      code = 0;
      count = 0;
      while ((c <= '7') && (c >= '0') && (count++ < 3))
	{
	  code = (code * 8) + (c - '0');
	  c = getc (finput);
	}
      ungetc (c, finput);
      return code;

    case '\\': case '\'': case '"':
      return c;

    case '\n':
      lineno++;
      return -1;

    case 'n':
      return TARGET_NEWLINE;

    case 't':
      return TARGET_TAB;

    case 'r':
      return TARGET_CR;

    case 'f':
      return TARGET_FF;

    case 'b':
      return TARGET_BS;

    case 'a':
      return TARGET_BELL;

    case 'v':
      return TARGET_VT;

    case 'E':
      return 033;

    case '?':
      /* `\(', etc, are used at beginning of line to avoid confusing Emacs.  */
    case '(':
    case '{':
    case '[':
      return c;
    }
  if (c >= 040 && c <= 0177)
    warning ("unknown escape sequence `\\%c'", c);
  else
    warning ("unknown escape sequence: `\\' followed by char code 0x%x", c);
  return c;
}

void
yyerror (string)
     char *string;
{
  char buf[200];

  strcpy (buf, string);

  /* We can't print string and character constants well
     because the token_buffer contains the result of processing escapes.  */
  if (end_of_file)
    strcat (buf, " at end of input");
  else if (token_buffer[0] == 0)
    strcat (buf, " at null character");
  else if (token_buffer[0] == '"')
    strcat (buf, " before string constant");
  else if (token_buffer[0] == '\'')
    strcat (buf, " before character constant");
  else if (token_buffer[0] < 040 || token_buffer[0] >= 0177)
    sprintf (buf + strlen (buf), " before character 0%o", token_buffer[0]);
  else
    strcat (buf, " before `%s'");

  error (buf, token_buffer);
}

static int nextchar = -1;

static int
yylex ()
{
  register int c;
  register char *p;
  register int value;
  int wide_flag = 0;

  if (nextchar >= 0)
    c = nextchar, nextchar = -1;
  else
    c = getc (finput);

  /* Effectively do c = skip_white_space (c)
     but do it faster in the usual cases.  */
  while (1)
    switch (c)
      {
      case ' ':
      case '\t':
      case '\f':
      case '\r':
      case '\b':
	c = getc (finput);
	break;

      case '\n':
      case '/':
      case '\\':
	c = skip_white_space (c);
      default:
	goto found_nonwhite;
      }
 found_nonwhite:

  token_buffer[0] = c;
  token_buffer[1] = 0;

/*  yylloc.first_line = lineno; */

  switch (c)
    {
    case EOF:
      end_of_file = 1;
      token_buffer[0] = 0;
      value = ENDFILE;
      break;

    case '$':
      if (dollars_in_ident)
	goto letter;
      return '$';

    case 'L':
      /* Capital L may start a wide-string or wide-character constant.  */
      {
	register int c = getc (finput);
	if (c == '\'')
	  {
	    wide_flag = 1;
	    goto char_constant;
	  }
	if (c == '"')
	  {
	    wide_flag = 1;
	    goto string_constant;
	  }
	ungetc (c, finput);
      }

    case 'A':  case 'B':  case 'C':  case 'D':  case 'E':
    case 'F':  case 'G':  case 'H':  case 'I':  case 'J':
    case 'K':		  case 'M':  case 'N':  case 'O':
    case 'P':  case 'Q':  case 'R':  case 'S':  case 'T':
    case 'U':  case 'V':  case 'W':  case 'X':  case 'Y':
    case 'Z':
    case 'a':  case 'b':  case 'c':  case 'd':  case 'e':
    case 'f':  case 'g':  case 'h':  case 'i':  case 'j':
    case 'k':  case 'l':  case 'm':  case 'n':  case 'o':
    case 'p':  case 'q':  case 'r':  case 's':  case 't':
    case 'u':  case 'v':  case 'w':  case 'x':  case 'y':
    case 'z':
    case '_':
    letter:
      p = token_buffer;
      while (isalnum (c) || c == '_' || c == '$')
	{
	  if (p >= token_buffer + maxtoken)
	    p = extend_token_buffer (p);
	  if (c == '$' && ! dollars_in_ident)
	    break;

	  *p++ = c;
	  c = getc (finput);
	}

      *p = 0;
      nextchar = c;

      value = IDENTIFIER;
      yylval.itype = 0;

      /* Try to recognize a keyword.  Uses minimum-perfect hash function */
  
      {
	register struct resword *ptr;

	if (ptr = is_reserved_word (token_buffer, p - token_buffer))
	  {
	    if (ptr->rid)
	      yylval.ttype = ridpointers[(int) ptr->rid];
	    if ((! flag_no_asm
		 /* -fno-asm means don't recognize the non-ANSI keywords.  */
		 || ((int) ptr->token != ASM
		     && (int) ptr->token != TYPEOF
		     && ptr->rid != RID_INLINE)
		 /* Recognize __asm and __inline despite -fno-asm.  */
		 || token_buffer[0] == '_')
		/* -ftraditional means don't recognize nontraditional keywords
		   typeof, const, volatile, signed or inline.  */
		&& (! flag_traditional
		    || ((int) ptr->token != TYPE_QUAL
			&& (int) ptr->token != TYPEOF
			&& ptr->rid != RID_SIGNED
			&& ptr->rid != RID_INLINE)
		    /* Recognize __inline, etc. despite -ftraditional.  */
		    || token_buffer[0] == '_'))
	      value = (int) ptr->token;
	  }
      }

      /* If we did not find a keyword, look for an identifier
	 (or a typename).  */

      if (value == IDENTIFIER)
	{
          yylval.ttype = get_identifier (token_buffer);
	  lastiddecl = lookup_name (yylval.ttype);

	  if (lastiddecl != 0 && TREE_CODE (lastiddecl) == TYPE_DECL)
	    value = TYPENAME;
	}

      break;

    case '0':  case '1':  case '2':  case '3':  case '4':
    case '5':  case '6':  case '7':  case '8':  case '9':
    case '.':
      {
	int base = 10;
	int count = 0;
	int largest_digit = 0;
	int numdigits = 0;
	/* for multi-precision arithmetic,
	   we store only 8 live bits in each short,
	   giving us 64 bits of reliable precision */
	short shorts[8];

	enum anon1 { NOT_FLOAT, AFTER_POINT, TOO_MANY_POINTS} floatflag
	  = NOT_FLOAT;

	for (count = 0; count < 8; count++)
	  shorts[count] = 0;

	p = token_buffer;
	*p++ = c;

	if (c == '0')
	  {
	    *p++ = (c = getc (finput));
	    if ((c == 'x') || (c == 'X'))
	      {
		base = 16;
		*p++ = (c = getc (finput));
	      }
	    else
	      {
		base = 8;
		numdigits++;
	      }
	  }

	/* Read all the digits-and-decimal-points.  */

	while (c == '.'
	       || (isalnum (c) && (c != 'l') && (c != 'L')
		   && (c != 'u') && (c != 'U')
		   && (floatflag == NOT_FLOAT || ((c != 'f') && (c != 'F')))))
	  {
	    if (c == '.')
	      {
		if (base == 16)
		  error ("floating constant may not be in radix 16");
		if (floatflag == AFTER_POINT)
		  {
		    error ("malformed floating constant");
		    floatflag = TOO_MANY_POINTS;
		  }
		else
		  floatflag = AFTER_POINT;

		base = 10;
		*p++ = c = getc (finput);
		/* Accept '.' as the start of a floating-point number
		   only when it is followed by a digit.
		   Otherwise, unread the following non-digit
		   and use the '.' as a structural token.  */
		if (p == token_buffer + 2 && !isdigit (c))
		  {
		    if (c == '.')
		      {
			c = getc (finput);
			if (c == '.')
			  {
			    *p++ = c;
			    *p = 0;
			    return ELLIPSIS;
			  }
			error ("parse error at `..'");
		      }
		    ungetc (c, finput);
		    token_buffer[1] = 0;
		    value = '.';
		    goto done;
		  }
	      }
	    else
	      {
		/* It is not a decimal point.
		   It should be a digit (perhaps a hex digit).  */

		if (isdigit (c))
		  {
		    c = c - '0';
		  }
		else if (base <= 10)
		  {
		    if ((c&~040) == 'E')
		      {
			base = 10;
			floatflag = AFTER_POINT;
			break;   /* start of exponent */
		      }
		    error ("nondigits in number and not hexadecimal");
		    c = 0;
		  }
		else if (c >= 'a')
		  {
		    c = c - 'a' + 10;
		  }
		else
		  {
		    c = c - 'A' + 10;
		  }
		if (c >= largest_digit)
		  largest_digit = c;
		numdigits++;
	    
		for (count = 0; count < 8; count++)
		  {
		    (shorts[count] *= base);
		    if (count)
		      {
			shorts[count] += (shorts[count-1] >> 8);
			shorts[count-1] &= (1<<8)-1;
		      }
		    else shorts[0] += c;
		  }
    
		if (p >= token_buffer + maxtoken - 3)
		  p = extend_token_buffer (p);
		*p++ = (c = getc (finput));
	      }
	  }

	if (numdigits == 0)
	  error ("numeric constant with no digits");

	if (largest_digit >= base)
	  error ("numeric constant contains digits beyond the radix");

	/* Remove terminating char from the token buffer and delimit the string */
	*--p = 0;

	if (floatflag != NOT_FLOAT)
	  {
	    tree type = double_type_node;
	    char f_seen = 0;
	    char l_seen = 0;
	    REAL_VALUE_TYPE value;

	    /* Read explicit exponent if any, and put it in tokenbuf.  */

	    if ((c == 'e') || (c == 'E'))
	      {
		if (p >= token_buffer + maxtoken - 3)
		  p = extend_token_buffer (p);
		*p++ = c;
		c = getc (finput);
		if ((c == '+') || (c == '-'))
		  {
		    *p++ = c;
		    c = getc (finput);
		  }
		if (! isdigit (c))
		  error ("floating constant exponent has no digits");
	        while (isdigit (c))
		  {
		    if (p >= token_buffer + maxtoken - 3)
		      p = extend_token_buffer (p);
		    *p++ = c;
		    c = getc (finput);
		  }
	      }

	    *p = 0;
	    errno = 0;
	    value = REAL_VALUE_ATOF (token_buffer);
#ifdef ERANGE
	    if (errno == ERANGE && !flag_traditional)
	      {
		char *p1 = token_buffer;
		/* Check for "0.0" and variants;
		   Sunos 4 spuriously returns ERANGE for them.  */
		while (*p1 == '0') p1++;
		if (*p1 == '.') p1++;
		while (*p1 == '0') p1++;
		if (*p1 != 0)
		  warning ("floating point number exceeds range of `double'");
	      }
#endif

	    /* Read the suffixes to choose a data type.  */
	    while (1)
	      {
		if (c == 'f' || c == 'F')
		  {
		    if (f_seen)
		      error ("two `f's in floating constant");
		    f_seen = 1;
		    type = float_type_node;
		  }
		else if (c == 'l' || c == 'L')
		  {
		    if (l_seen)
		      error ("two `l's in floating constant");
		    l_seen = 1;
		    type = long_double_type_node;
		  }
		else
		  {
		    if (isalnum (c))
		      {
			error ("garbage at end of number");
			while (isalnum (c))
			  {
			    if (p >= token_buffer + maxtoken - 3)
			      p = extend_token_buffer (p);
			    *p++ = c;
			    c = getc (finput);
			  }
		      }
		    break;
		  }
		if (p >= token_buffer + maxtoken - 3)
		  p = extend_token_buffer (p);
		*p++ = c;
		c = getc (finput);
	      }

	    /* Create a node with determined type and value.  */
	    yylval.ttype = build_real (type, value);

	    ungetc (c, finput);
	    *p = 0;
	  }
	else
	  {
	    tree type;
	    int spec_unsigned = 0;
	    int spec_long = 0;

	    while (1)
	      {
		if (c == 'u' || c == 'U')
		  {
		    if (spec_unsigned)
		      error ("two `u's in integer constant");
		    spec_unsigned = 1;
		  }
		else if (c == 'l' || c == 'L')
		  {
		    if (spec_long)
		      error ("two `l's in integer constant");
		    spec_long = 1;
		  }
		else
		  {
		    if (isalnum (c))
		      {
			error ("garbage at end of number");
			while (isalnum (c))
			  {
			    if (p >= token_buffer + maxtoken - 3)
			      p = extend_token_buffer (p);
			    *p++ = c;
			    c = getc (finput);
			  }
		      }
		    break;
		  }
		if (p >= token_buffer + maxtoken - 3)
		  p = extend_token_buffer (p);
		*p++ = c;
		c = getc (finput);
	      }

	    ungetc (c, finput);

	    if (shorts[7] | shorts[6] | shorts[5] | shorts[4])
	      warning ("integer constant out of range");

	    /* This is simplified by the fact that our constant
	       is always positive.  */
	    yylval.ttype
	      = build_int_2 ((shorts[3]<<24) + (shorts[2]<<16) + (shorts[1]<<8) + shorts[0],
			     0);
    
	    if (!spec_long && !spec_unsigned
		&& int_fits_type_p (yylval.ttype, integer_type_node))
	      type = integer_type_node;

	    else if (!spec_long && base != 10
		&& int_fits_type_p (yylval.ttype, unsigned_type_node))
	      type = unsigned_type_node;

	    else if (!spec_unsigned
		&& int_fits_type_p (yylval.ttype, long_integer_type_node))
	      type = long_integer_type_node;

	    else
	      {
		type = long_unsigned_type_node;
		if (! int_fits_type_p (yylval.ttype, long_unsigned_type_node))
		  warning ("integer constant out of range");
	      }
	    TREE_TYPE (yylval.ttype) = type;
	  }

	value = CONSTANT; break;
      }

    case '\'':
    char_constant:
      c = getc (finput);
      {
	register int code = 0;

      tryagain:

	if (c == '\\')
	  {
	    c = readescape ();
	    if (c < 0)
	      goto tryagain;
	    if (!wide_flag && c >= (1 << BITS_PER_UNIT))
	      warning ("escape sequence out of range for character");
	  }
	else if (c == '\n')
	  {
	    if (pedantic)
	      warning ("ANSI C forbids newline in character constant");
	    lineno++;
	  }

	code = c;
	token_buffer[1] = c;
	token_buffer[2] = '\'';
	token_buffer[3] = 0;

	c = getc (finput);
	if (c != '\'')
	  error ("malformatted character constant");

	/* If char type is signed, sign-extend the constant.  */
	if (! wide_flag)
	  {
	    if (TREE_UNSIGNED (char_type_node)
		|| ((code >> (BITS_PER_UNIT - 1)) & 1) == 0)
	      yylval.ttype = build_int_2 (code & ((1 << BITS_PER_UNIT) - 1), 0);
	    else
	      yylval.ttype = build_int_2 (code | ((-1) << BITS_PER_UNIT), -1);
	  }
	else
	  yylval.ttype = build_int_2 (code, 0);

	TREE_TYPE (yylval.ttype) = integer_type_node;
	value = CONSTANT; break;
      }

    case '"':
    string_constant:
      {
	int *widep;

	c = getc (finput);
	p = token_buffer + 1;

	if (wide_flag)
	  widep = wide_buffer;

	while (c != '"' && c >= 0)
	  {
	    if (c == '\\')
	      {
		c = readescape ();
		if (c < 0)
		  goto skipnewline;
		if (!wide_flag && c >= (1 << BITS_PER_UNIT))
		  warning ("escape sequence out of range for character");
	      }
	    else if (c == '\n')
	      {
		if (pedantic)
		  warning ("ANSI C forbids newline in string constant");
		lineno++;
	      }

	    /* Store the char in C into the appropriate buffer.  */

	    if (wide_flag)
	      {
		if (widep == wide_buffer + max_wide)
		  {
		    int n = widep - wide_buffer;
		    max_wide *= 2;
		    wide_buffer = (int *) xrealloc (wide_buffer, max_wide + 1);
		    widep = wide_buffer + n;
		  }
		*widep++ = c;
	      }
	    else
	      {
		if (p == token_buffer + maxtoken)
		  p = extend_token_buffer (p);
		*p++ = c;
	      }

	  skipnewline:
	    c = getc (finput);
	  }

	/* We have read the entire constant.
	   Construct a STRING_CST for the result.  */

	if (wide_flag)
	  {
	    /* If this is a L"..." wide-string, make a vector
	       of the ints in wide_buffer.  */
	    *widep = 0;
	    /* We have not implemented the case where `int'
	       on the target and on the execution machine differ in size.  */
	    if (TYPE_PRECISION (integer_type_node)
		!= sizeof (int) * BITS_PER_UNIT)
	      abort ();
	    yylval.ttype = build_string ((widep - wide_buffer) * sizeof (int),
					 wide_buffer);
	    TREE_TYPE (yylval.ttype) = int_array_type_node;
	  }
	else
	  {
	    *p = 0;
	    yylval.ttype = build_string (p - token_buffer, token_buffer + 1);
	    TREE_TYPE (yylval.ttype) = char_array_type_node;
	  }

	*p++ = '"';
	*p = 0;

	value = STRING; break;
      }
      
    case '+':
    case '-':
    case '&':
    case '|':
    case '<':
    case '>':
    case '*':
    case '/':
    case '%':
    case '^':
    case '!':
    case '=':
      {
	register int c1;

      combine:

	switch (c)
	  {
	  case '+':
	    yylval.code = PLUS_EXPR; break;
	  case '-':
	    yylval.code = MINUS_EXPR; break;
	  case '&':
	    yylval.code = BIT_AND_EXPR; break;
	  case '|':
	    yylval.code = BIT_IOR_EXPR; break;
	  case '*':
	    yylval.code = MULT_EXPR; break;
	  case '/':
	    yylval.code = TRUNC_DIV_EXPR; break;
	  case '%':
	    yylval.code = TRUNC_MOD_EXPR; break;
	  case '^':
	    yylval.code = BIT_XOR_EXPR; break;
	  case LSHIFT:
	    yylval.code = LSHIFT_EXPR; break;
	  case RSHIFT:
	    yylval.code = RSHIFT_EXPR; break;
	  case '<':
	    yylval.code = LT_EXPR; break;
	  case '>':
	    yylval.code = GT_EXPR; break;
	  }	

	token_buffer[1] = c1 = getc (finput);
	token_buffer[2] = 0;

	if (c1 == '=')
	  {
	    switch (c)
	      {
	      case '<':
		value = ARITHCOMPARE; yylval.code = LE_EXPR; goto done;
	      case '>':
		value = ARITHCOMPARE; yylval.code = GE_EXPR; goto done;
	      case '!':
		value = EQCOMPARE; yylval.code = NE_EXPR; goto done;
	      case '=':
		value = EQCOMPARE; yylval.code = EQ_EXPR; goto done;
	      }	
	    value = ASSIGN; goto done;
	  }
	else if (c == c1)
	  switch (c)
	    {
	    case '+':
	      value = PLUSPLUS; goto done;
	    case '-':
	      value = MINUSMINUS; goto done;
	    case '&':
	      value = ANDAND; goto done;
	    case '|':
	      value = OROR; goto done;
	    case '<':
	      c = LSHIFT;
	      goto combine;
	    case '>':
	      c = RSHIFT;
	      goto combine;
	    }
	else if ((c == '-') && (c1 == '>'))
	  { value = POINTSAT; goto done; }
	ungetc (c1, finput);
	token_buffer[1] = 0;

	if ((c == '<') || (c == '>'))
	  value = ARITHCOMPARE;
	else value = c;
	goto done;
      }

    case 0:
      /* Don't make yyparse think this is eof.  */
      value = 1;
      break;

    default:
      value = c;
    }

done:
/*  yylloc.last_line = lineno; */

  return value;
}
